Absolutely Non-effective Predicates and Functions in Computable Analysis

DOI10.1007/978-3-540-72504-6_54MaRDI QIDQ5425471zbMATH OpenOpenAlexFDO

Authors Decheng Ding, Klaus Weihrauch, Yongcheng Wu

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_54

zbMATH Keywords

setmeasurerepresentationundecidabilitycomputability

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Absolutely non-computable predicates and functions in analysis
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 2013199
• scientific article; zbMATH DE number 1460545
• scientific article; zbMATH DE number 1101599

Cited in

(4)

• Absolutely non-computable predicates and functions in analysis
• Positive predicate structures for continuous data
• Effective Choice and Boundedness Principles in Computable Analysis
• Beyond Rogers’ Non-constructively Computable Function

This page was built for publication: Absolutely Non-effective Predicates and Functions in Computable Analysis

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