Computability of continuous solutions of higher-type equations

DOI10.1007/978-3-642-03073-4_20MaRDI QIDQ3576051zbMATH OpenOpenAlexFDO

Authors Martín Escardo

Publication date 28 July 2010

Published in Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03073-4_20

zbMATH Keywords

exhaustible sethigher-type computabilityKleene-Kreisel spaces of continuous functionals

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Recommendations

• Algorithmic solution of higher type equations
• A tutorial on computable analysis
• New Computational Paradigms
• Solving functional equations at higher types; some examples and some theorems
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions

Cites work

• A Relationship between Equilogical Spaces and Type Two Effectivity
• Exhaustible sets in higher-type computation
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 1222580 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Recursion on the countable functionals

Cited in

(4)

• Solving functional equations at higher types; some examples and some theorems
• Algorithmic solution of higher type equations
• Exhaustible sets in higher-type computation
• Computability of solutions of operator equations

This page was built for publication: Computability of continuous solutions of higher-type equations

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