| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424414 | Electronic Notes in Theoretical Computer Science | 2007 | 13 Pages |
Abstract
We prove computable versions of the Implicit Function Theorem in the single and multivariable cases. We use Type Two Effectivity as our foundation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
