December 2006 Computability results used in differential geometry
Barbara F. Csima, Robert I. Soare
J. Symbolic Logic 71(4): 1394-1410 (December 2006). DOI: 10.2178/jsl/1164060462

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.

Citation

Download Citation

Barbara F. Csima. Robert I. Soare. "Computability results used in differential geometry." J. Symbolic Logic 71 (4) 1394 - 1410, December 2006. https://doi.org/10.2178/jsl/1164060462

Information

Published: December 2006
First available in Project Euclid: 20 November 2006

zbMATH: 1109.03035
MathSciNet: MR2275866
Digital Object Identifier: 10.2178/jsl/1164060462

Rights: Copyright © 2006 Association for Symbolic Logic

JOURNAL ARTICLE
17 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.71 • No. 4 • December 2006
Back to Top