Computability and the Implicit Function Theorem
Work
Year: 2007
Type: article
Abstract: We prove computable versions of the Implicit Function Theorem in the single and multivariable cases. We use Type Two Effectivity as our foundation.
Author Timothy H. McNicholl
Institution Lamar University
Cites: 12
Cited by: 2
Related to: 10
FWCI: 0.606
Citation percentile (by year/subfield): 48.59
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold