Computability and the Implicit Function Theorem

Electronic Notes in Theoretical Computer Science

Volumn 167, Issue , 2007, Pages 3-15

  McNicholl, Timothy H ^a  

^a LAMAR UNIVERSITY   (United States)

Author keywords

Computability; Computable Analysis

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; MULTIVARIABLE SYSTEMS;

COMPUTABLE ANALYSIS; IMPLICIT FUNCTION THEOREM;

THEOREM PROVING;

EID: 33846243780     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.08.004     Document Type: Article

References (7)

1. Hale J. Ordinary Differential Equations. 2nd ed. (1980), Wiley
2. Krantz S., and Parks H. The Implicit Function Theorem. 1st ed. (2002), Birkhäuser, Boston
3. Rosenlicht M. Introduction to Analysis. 1st ed. (1986), Dover
4. Soare R.I. Recursively Enumerable Sets and Degrees. 1st ed. (1987), Springer-Verlag, Berlin, Heidelberg
5. Weihrauch K. Computable Analysis. An Introduction. 1st ed. (2000), Springer-Verlag, Berlin
6. Weihrauch K., and Zhong N. The Wave Propogator is Turing Computable. Automata, languages, and programming (Prague, 1999). Lecture Notes in Computer Science 1644 (1999), Springer, Berlin 697-706 1999
7. Ziegler M., and Brattka V. Computability in linear algebra. Theoretical Computer Science 326 (2004) 187-211