Algorithmic solution of higher type equations

DOI10.1093/logcom/exr048zbMath1270.03065OpenAlexW2015523765MaRDI QIDQ2844001

Martín Hötzel Escardó

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 representationhigher-type computabilitycomputationally compact setexhaustible setKleene-Kreisel spaces of continuous functionalsQCB spacesearchable settopology in the theory of computation

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items (1)

Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy

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