Absolutely Non-effective Predicates and Functions in Computable Analysis

DOI10.1007/978-3-540-72504-6_54zbMath1200.03027OpenAlexW1544102261MaRDI QIDQ5425471

Yongcheng Wu, Ding, Decheng, Weihrauch, Klaus

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

setundecidabilityrepresentationmeasurecomputability

Mathematics Subject Classification ID

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

Related Items (1)

Absolutely non-computable predicates and functions in analysis

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