Beyond Rogers’ Non-constructively Computable Function

DOI10.1007/978-3-642-39053-1_6zbMATH Open1433.03121OpenAlexW52948400MaRDI QIDQ5326358

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

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On some computability notions for real functions 👍 👎
• A new characterization of computable functions 👍 👎
• On a Relative Computability Notion for Real Functions 👍 👎
• Pseudo-extensions of computable functions 👍 👎
• Absolutely non-computable predicates and functions in analysis 👍 👎
• On Non-Computable Functions 👍 👎
• Absolutely Non-effective Predicates and Functions in Computable Analysis 👍 👎

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)