Analytical properties of resource-bounded real functionals

Computable analysis is an extension of classical discrete computability by enhancing the normal Turing machine model. It investigates mathematical analysis from the computability perspective. Though it is well developed on the computability level, it is still under developed on the complexity perspective, that is, when bounding the available computational resources. Recently Kawamura and Cook developed a framework to define the computational complexity of operators arising in analysis. Our goal is to understand the effects of complexity restrictions on the analytical properties of the operator. We focus on the case of norms over C[0,1] and introduce the notion of dependence of a norm on a point and relate it to the query complexity of the norm. We show that the dependence of almost every point is of the order of the query complexity of the norm. A norm with small complexity depends on a few points but, as compensation, highly depends on them. We briefly show how to obtain similar results for non-deterministic time complexity. We characterize the functionals that are computable using one oracle call only and discuss the uniformity of that characterization. This paper is a significant revision and expansion of an earlier conference version

Bounded time computation on metric spaces and Banach spaces

We extend the framework by Kawamura and Cook for investigating computational complexity for operators occurring in analysis. This model is based on second-order complexity theory for functions on the Baire space, which is lifted to metric spaces by means of representations. Time is measured in terms of the length of the input encodings and the required output precision. We propose the notions of a complete representation and of a regular representation. We show that complete representations ensure that any computable function has a time bound. Regular representations generalize Kawamura and Cook's more restrictive notion of a second-order representation, while still guaranteeing fast computability of the length of the encodings. Applying these notions, we investigate the relationship between purely metric properties of a metric space and the existence of a representation such that the metric is computable within bounded time. We show that a bound on the running time of the metric can be straightforwardly translated into size bounds of compact subsets of the metric space. Conversely, for compact spaces and for Banach spaces we construct a family of admissible, complete, regular representations that allow for fast computation of the metric and provide short encodings. Here it is necessary to trade the time bound off against the length of encodings

Frank Discussion of the Status of Ground-state Orbital-free DFT

F.E. Harris has been a significant partner in our work on orbital-free density functional approximations for use in ab initio molecular dynamics. Here we mention briefly the essential progress on single-point functionals since our original paper (2006). Then we focus on the advantages and limitations of generalized gradient approximation (GGA) non-interacting kinetic-energy functionals. We reconsider the constraints provided by near-origin conditions in atomic-like systems and their relationship to regularized versus physical external potentials. Then we seek the best empirical GGA for the non-interacting KE for a modest-sized set of molecules with a well-defined near-origin behavior of their densities. The search is motivated by a desire for insight into GGA limitations and for a target for constraint-based development

Selection theorem for systems with inheritance

The problem of finite-dimensional asymptotics of infinite-dimensional dynamic systems is studied. A non-linear kinetic system with conservation of supports for distributions has generically finite-dimensional asymptotics. Such systems are apparent in many areas of biology, physics (the theory of parametric wave interaction), chemistry and economics. This conservation of support has a biological interpretation: inheritance. The finite-dimensional asymptotics demonstrates effects of "natural" selection. Estimations of the asymptotic dimension are presented. After some initial time, solution of a kinetic equation with conservation of support becomes a finite set of narrow peaks that become increasingly narrow over time and move increasingly slowly. It is possible that these peaks do not tend to fixed positions, and the path covered tends to infinity as t goes to infinity. The drift equations for peak motion are obtained. Various types of distribution stability are studied: internal stability (stability with respect to perturbations that do not extend the support), external stability or uninvadability (stability with respect to strongly small perturbations that extend the support), and stable realizability (stability with respect to small shifts and extensions of the density peaks). Models of self-synchronization of cell division are studied, as an example of selection in systems with additional symmetry. Appropriate construction of the notion of typicalness in infinite-dimensional space is discussed, and the notion of "completely thin" sets is introduced. Key words: Dynamics; Attractor; Evolution; Entropy; Natural selectionComment: 46 pages, the final journal versio