Computability and the Implicit Function TheoremProceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006) (2007)
We prove computable versions of the Implicit Function Theorem in the single and multivariable cases. We use Type Two Effectivity as our foundation.
- Computable Analysis,
LocationUniversity of Florida, Gainesville, USA
Citation InformationTimothy 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.