scholarly journals Computability Theory and Differential Geometry

2004 ◽  
Vol 10 (4) ◽  
pp. 457-486 ◽  
Author(s):  
Robert I. Soare

Abstract. LetMbe a smooth, compact manifold of dimensionn≥ 5 and sectional curvature ∣K∣ ≤ 1. Let Met(M) = Riem(M)/Diff(M) be the space of Riemannian metrics onMmodulo isometries. Nabutovsky and Weinberger studied the connected components of sublevel sets (and local minima) for certain functions on Met(M) such as the diameter. They showed that for every Turing machineTe,eϵ ω, there is a sequence (uniformly effective ine) of homologyn-sphereswhich are also hypersurfaces, such thatis diffeomorphic to the standardn-sphereSn(denoted)iffTehalts on inputk, and in this case the connected sum, so, andis associated with a local minimum of the diameter function on Met(M) whose depth is roughly equal to the settling time ae σe(k)ofTeon inputsy<k.At their request Soare constructed a particular infinite sequence {Ai}ϵωof c.e. sets so that for allithe settling time of the associated Turing machine forAidominates that forAi+1, even when the latter is composed with an arbitrary computable function. From this, Nabutovsky and Weinberger showed that the basins exhibit a “fractal” like behavior with extremely big basins, and very much smaller basins coming off them, and so on. This reveals what Nabutovsky and Weinberger describe in their paper on fractals as “the astonishing richness of the space of Riemannian metrics on a smooth manifold, up to reparametrization.” From the point of view of logic and computability, the Nabutovsky-Weinberger results are especially interesting because: (1) they use c.e. sets to prove structuralcomplexityof the geometry and topology, not merelyundecidabilityresults as in the word problem for groups, Hilbert's Tenth Problem, or most other applications; (2) they usenontrivialinformation about c.e. sets, the Soare sequence {Ai}iϵωabove, not merely Gödel's c.e. noncomputable set K of the 1930's; and (3)withoutusing computability theory there is no known proof that local minima exist even for simple manifolds like the torusT5(see §9.5).

Author(s):  
Matthew J. Gursky ◽  
Jeff A. Viaclovsky

AbstractWe investigate rigidity and stability properties of critical points of quadratic curvature functionals on the space of Riemannian metrics. We show it is possible to “gauge” the Euler–Lagrange equations, in a self-adjoint fashion, to become elliptic. Fredholm theory may then be used to describe local properties of the moduli space of critical metrics. We show a number of compact examples are infinitesimally rigid, and consequently, are isolated critical points in the space of unit-volume Riemannian metrics. We then give examples of critical metrics which are strict local minimizers (up to diffeomorphism and scaling). A corollary is a local “reverse Bishop's inequality” for such metrics. In particular, any metric


1991 ◽  
Vol 5 (2) ◽  
pp. 145-157 ◽  
Author(s):  
F. Baccelli ◽  
N. Bambos ◽  
J. Walrand

In this work, the discrete event systems called Stochastic Marked Graphs (SMGs) are investigated from a stability point of view. Being a special class of Timed Petri Nets with stochastic firing times, they are studied under general assumptions of stationarity and ergodicity of the firing times and ergodicity of flows of their free strongly connected components. The values of the flows of tokens in an SMG are specified as functions of the intrinsic rates of its free strongly connected components, and various stability issues are discussed.


1972 ◽  
Vol 37 (1) ◽  
pp. 55-68 ◽  
Author(s):  
Albert R. Meyer ◽  
Patrick C. Fischer

The complexity of a computable function can be measured by considering the time or space required to compute its values. Particular notions of time and space arising from variants of Turing machines have been investigated by R. W. Ritchie [14], Hartmanis and Stearns [8], and Arbib and Blum [1], among others. General properties of such complexity measures have been characterized axiomatically by Rabin [12], Blum [2], Young [16], [17], and McCreight and Meyer [10].In this paper the speed-up and super-speed-up theorems of Blum [2] are generalized to speed-up by arbitrary total effective operators. The significance of such theorems is that one cannot equate the complexity of a computable function with the running time of its fastest program, for the simple reason that there are computable functions which in a very strong sense have no fastest programs.Let φi be the ith partial recursive function of one variable in a standard Gödel numbering of partial recursive functions. A family Φ0, Φ1, … of functions of one variable is called a Blum measure on computation providing(1) domain (φi) = domain (Φi), and(2) the predicate [Φi(x) = m] is recursive in i, x and m.Typical interpretations of Φi(x) are the number of steps required by the ith Turing machine (in a standard enumeration of Turing machines) to converge on input x, the space or number of tape squares required by the ith Turing machine to converge on input x (with the convention that Φi(x) is undefined even if the machine fails to halt in a finite loop), and the length of the shortest derivation of the value of φi(x) from the ith set of recursive equations.


1965 ◽  
Vol 17 ◽  
pp. 185-198
Author(s):  
C. E. Castonguay ◽  
H. G. Helfenstein

Every abstract open Riemann surface can be made "concrete" (in the terminology of (1)) by considering it as a covering surface (in general branched) of the complex plane by means of a suitable projection map p. Since this covering map is not unique, it seems natural to single out some such maps by an extremal property. The use of Riemannian metrics compatible with the conformai structure on the given surface for the study of $1 is well known ; from the point of view of differential geometry it suggests an investigation of the distortion caused by p between such a metric ds^ and the Euclidean metric of .


2006 ◽  
Vol 16 (03) ◽  
pp. 381-403 ◽  
Author(s):  
SELIM G. AKL

It is shown that the concept of a Universal Computer cannot be realized. Specifically, instances of a computable function [Formula: see text] are exhibited that cannot be computed on any machine [Formula: see text] that is capable of only a finite and fixed number of operations per step. This remains true even if the machine [Formula: see text] is endowed with an infinite memory and the ability to communicate with the outside world while it is attempting to compute [Formula: see text]. It also remains true if, in addition, [Formula: see text] is given an indefinite amount of time to compute [Formula: see text]. This result applies not only to idealized models of computation, such as the Turing Machine and the like, but also to all known general-purpose computers, including existing conventional computers (both sequential and parallel), as well as contemplated unconventional ones such as biological and quantum computers. Even accelerating machines (that is, machines that increase their speed at every step) cannot be universal.


2020 ◽  
Vol 63 (4) ◽  
pp. 901-908
Author(s):  
Philipp Reiser

AbstractLet $M$ be a topological spherical space form, i.e., a smooth manifold whose universal cover is a homotopy sphere. We determine the number of path components of the space and moduli space of Riemannian metrics with positive scalar curvature on $M$ if the dimension of $M$ is at least 5 and $M$ is not simply-connected.


Author(s):  
Bernd Ammann ◽  
Klaus Kröncke ◽  
Olaf Müller

AbstractLorentzian manifolds with parallel spinors are important objects of study in several branches of geometry, analysis and mathematical physics. Their Cauchy problem has recently been discussed by Baum, Leistner and Lischewski, who proved that the problem locally has a unique solution up to diffeomorphisms, provided that the intial data given on a space-like hypersurface satisfy some constraint equations. In this article we provide a method to solve these constraint equations. In particular, any curve (resp. closed curve) in the moduli space of Riemannian metrics on M with a parallel spinor gives rise to a solution of the constraint equations on $$M\times (a,b)$$ M × ( a , b ) (resp. $$M\times S^1$$ M × S 1 ).


Sign in / Sign up

Export Citation Format

Share Document