Computability and the Implicit Function Theorem

DOI10.1016/J.ENTCS.2006.08.004MaRDI QIDQ4921433zbMATH OpenOpenAlexFDO

Authors Timothy H. McNicholl

Publication date 10 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.08.004

zbMATH Keywords

computabilitycomputable analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Implicit function theorems, Jacobians, transformations with several variables (26B10) Implicit function theorems; global Newton methods on manifolds (58C15)

Recommendations

• A uniformly computable Implicit Function Theorem
• Publication:4207514
• Computability theory of generalized functions
• scientific article; zbMATH DE number 1746042
• scientific article; zbMATH DE number 4112573
• scientific article; zbMATH DE number 65741
• Computability over the partial continuous functionals
• Computability on measurable functions
• Computable functions of reals
• A new characterization of computable functions

Cites work

• Computability in linear algebra
• scientific article; zbMATH DE number 3674497 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1765103 (Why is no real title available?)
• scientific article; zbMATH DE number 1405673 (Why is no real title available?)
• scientific article; zbMATH DE number 3263356 (Why is no real title available?)

Cited in

(6)

• Functions computable with limited access to NP
• Computability of a function with jumps: Effective uniformity and limiting recursion
• scientific article; zbMATH DE number 6691416 (Why is no real title available?)
• The Veblen functions for computability theorists
• scientific article; zbMATH DE number 4033742 (Why is no real title available?)
• The computational content of Walras' existence theorem

This page was built for publication: Computability and the Implicit Function Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921433)