"Computability and the Implicit Function Theorem" by Timothy H. McNicholl

Selected Works of Timothy McNicholl

Follow Contact

Presentation

Computability and the Implicit Function Theorem

Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006) (2007)

Timothy H. McNicholl, Lamar University

Download

Abstract

We prove computable versions of the Implicit Function Theorem in the single and multivariable cases. We use Type Two Effectivity as our foundation.

Keywords

Computable Analysis,
Computability

Disciplines

Publication Date

2007

Location

University of Florida, Gainesville, USA

DOI

10.1016/j.entcs.2006.08.004

Comments

This proceeding was published as McNicholl, Timothy H. "Computability and the implicit function theorem." Electronic Notes in Theoretical Computer Science 167 (2007): 3-15.

Citation Information

Timothy H. McNicholl. "Computability and the Implicit Function Theorem" Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006) (2007)
Available at: http://works.bepress.com/timothy-mcnicholl/30/

Creative Commons License

This work is licensed under a Creative Commons CC_BY-NC-ND International License.