Computability Theory and Differential Geometry
From MaRDI portal
Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23) Manifolds of metrics (especially Riemannian) (58D17)
Recommendations
- Computability Results Used in Differential Geometry
- Computers and differential geometry
- Abstract Geometrical Computation and Computable Analysis
- New Computational Paradigms
- scientific article; zbMATH DE number 3995937
- Differential geometric computations and computer algebra
- scientific article; zbMATH DE number 7376056
- Computable Geometric Complex Analysis and Complex Dynamics
- Topology, domain theory and theoretical computer science
- Computability Models: Algebraic, Topological and Geometric Algorithms
Cites work
- Algorithmic unsolvability of the triviality problem for multidimensional knots
- An Unsolvable Problem of Elementary Number Theory
- Disconnectedness of sublevel sets of some Riemannian functionals
- Einstein structures: Existence versus uniqueness
- Finiteness Theorems for Riemannian Manifolds
- Fundamental group and contractible closed geodesics
- Generalized Poincaré's conjecture in dimensions greater than four
- Geometry of the space of triangulations of a compact manifold
- Groups of homotopy spheres. I
- Hilbert's Tenth Problem is Unsolvable
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3562121 (Why is no real title available?)
- scientific article; zbMATH DE number 550770 (Why is no real title available?)
- Isoperimetric functions of groups and computational complexity of the word problem
- Polyhedral homotopy-spheres
- Recursive unsolvability of group theoretic problems
- The fractal nature of Riem/Diff. I.
- The topology of four-dimensional manifolds
- The word problem
- The word problem
- Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
Cited in
(29)- Turing oracle machines, online computing, and three displacements in computability theory
- Non-low\(_2\)-ness and computable Lipschitz reducibility
- Randomness and reducibility
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Computability and Beltrami fields in Euclidean space
- Computing simplicial representatives of homotopy group elements
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- Extendability of continuous maps is undecidable
- The ibT degrees of computably enumerable sets are not dense
- Renormalisation and computation. II: Time cut-off and the halting problem
- On the strongly bounded Turing degrees of the computably enumerable sets
- Computing all maps into a sphere
- Computability Results Used in Differential Geometry
- Effective packing dimension of $\Pi ^0_1$-classes
- Structures of some strong reducibilities
- Bounding Helly numbers via Betti numbers
- Computers, Rigidity, and Moduli
- scientific article; zbMATH DE number 7376056 (Why is no real title available?)
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Foundations of online structure theory. II: The operator approach
- The settling-time reducibility ordering
- Computing all maps into a sphere
- Computational processes, observers and Turing incompleteness
- Hardness of embedding simplicial complexes in R^d
- Maximal pairs of c.e. reals in the computably Lipschitz degrees
- An arithmetic analysis of closed surfaces
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Compression of enumerations and gain
- Randomness and the linear degrees of computability
This page was built for publication: Computability Theory and Differential Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717234)
