Computability and the Implicit Function Theorem

DOI10.1016/j.entcs.2006.08.004zbMath1262.03142OpenAlexW1965247588MaRDI QIDQ4921433

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)

Cites Work

• Computability in linear algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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