Algorithmic solution of higher type equations

DOI10.1093/LOGCOM/EXR048MaRDI QIDQ2844001zbMATH OpenOpenAlexFDO

Authors Martín Escardo

Publication date 27 August 2013

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exr048

zbMATH Keywords

admissible representationcomputationally compact setexhaustible sethigher-type computabilityKleene-Kreisel spaces of continuous functionalsQCB spacesearchable settopology in the theory of computation

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Recommendations

• Computability of continuous solutions of higher-type equations
• Exhaustible sets in higher-type computation
• Solving functional equations at higher types; some examples and some theorems
• A tutorial on computable analysis
• Functionals of type 3 as realisers of classical theorems in analysis

Cited in

(6)

• Solving functional equations at higher types; some examples and some theorems
• Algorithmic solution of Abel's equation
• Exhaustible sets in higher-type computation
• Computability of continuous solutions of higher-type equations
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• An algebraic classification of solution generating techniques

This page was built for publication: Algorithmic solution of higher type equations

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