Computability and the Implicit Function Theorem

  • Authors:

  • Timothy H. McNicholl

  • Affiliations:

  • Department of Mathematics, Lamar University, Beaumont, Texas USA

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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