Computability Results Used in Differential Geometry
From MaRDI portal
Recommendations
Cites work
- Computability Theory and Differential Geometry
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 225477 (Why is no real title available?)
- Randomness and reducibility
- The fractal nature of Riem/Diff. I.
- The ibT degrees of computably enumerable sets are not dense
Cited in
(12)- Turing oracle machines, online computing, and three displacements in computability theory
- Computability and Beltrami fields in Euclidean space
- The ibT degrees of computably enumerable sets are not dense
- Computers, Rigidity, and Moduli
- scientific article; zbMATH DE number 7376056 (Why is no real title available?)
- Working with strong reducibilities above totally -c.e. and array computable degrees
- The settling-time reducibility ordering
- Comparing C.E. Sets Based on Their Settling Times
- Computability Theory and Differential Geometry
- The computable Lipschitz degrees of computably enumerable sets are not dense
- An arithmetic analysis of closed surfaces
- Nonrealizability proofs in computational geometry
This page was built for publication: Computability Results Used in Differential Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416121)