Non-deterministic computation and the Jayne-Rogers Theorem

zbMath1464.03042arXiv1404.0079MaRDI QIDQ4994845

Arno Pauly, Matthew De Brecht

Publication date: 22 June 2021

Full work available at URL: https://arxiv.org/abs/1404.0079

Mathematics Subject Classification ID

Descriptive set theory (03E15) Turing machines and related notions (03D10) Computation over the reals, computable analysis (03D78)

Related Items (11)

Comparing representations for function spaces in computable analysis ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ The Dyck and the Preiss separation uniformly ⋮ Unnamed Item ⋮ Point Degree Spectra of Represented Spaces ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency

This page was built for publication: Non-deterministic computation and the Jayne-Rogers Theorem