Beyond Rogers’ Non-constructively Computable Function

DOI10.1007/978-3-642-39053-1_6MaRDI QIDQ5326358zbMATH OpenOpenAlexFDO

Authors Michael Ralston, John Case

Publication date 5 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39053-1_6

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computation over the reals, computable analysis (03D78)

Recommendations

• On non-computable functions
• Absolutely non-computable predicates and functions in analysis
• Absolutely Non-effective Predicates and Functions in Computable Analysis
• A new characterization of computable functions
• On some computability notions for real functions
• On a relative computability notion for real functions
• On the extension of computable real functions
• scientific article; zbMATH DE number 1136098
• scientific article; zbMATH DE number 1746042
• Pseudo-extensions of computable functions

Cited in

(2)

• Constructivity conditions on immune sets
• Statements and open problems on decidable sets \(\mathcal{X} \subseteq \mathbb{N}\) that contain informal notions and refer to the current knowledge on \(\mathcal{X}\)

This page was built for publication: Beyond Rogers’ Non-constructively Computable Function

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