Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T10:07:53.669Z Has data issue: false hasContentIssue false

Computability Results Used in Differential Geometry

Published online by Cambridge University Press:  12 March 2014

Barbara F. Csima
Affiliation:
Department of Pure Mathematics, University of Waterloo, 200 University Ave. W. Waterloo, ON. N2L 3G1.Canada, E-mail: csima@math.uwaterloo.ca, URL: http://www.math.uwaterloo.ca/~csima
Robert I. Soare
Affiliation:
Department of Mathematics, University Of Chicago, Chicago, Illinois 60637-1546. USA, E-mail: soare@uchicago.edu URL: http://www.people.cs.uchicago.edu/~soare/

Abstract

Topologists Nabutovsky and Weinberger discovered how to embed computably enumerable (c.e.) sets into the geometry of Riemannian metrics modulo diffeomorphisms. They used the complexity of the settling times of the c.e. sets to exhibit a much greater complexity of the depth and density of local minima for the diameter function than previously imagined. Their results depended on the existence of certain sequences of c.e. sets, constructed at their request by Csima and Soare, whose settling times had the necessary dominating properties. Although these computability results had been announced earlier, their proofs have been deferred until this paper.

Computably enumerable sets have long been used to prove undecidability of mathematical problems such as the word problem for groups and Hilbert's Tenth Problem. However, this example by Nabutovsky and Weinberger is perhaps the first example of the use of c.e. sets to demonstrate specific mathematical or geometric complexity of a mathematical structure such as the depth and distribution of local minima.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable