The Arithmetical Hierarchy Over the Reals
From MaRDI portal
Publication:4018169
DOI10.1093/logcom/2.3.375zbMath0765.03020OpenAlexW2063091737WikidataQ57733319 ScholiaQ57733319MaRDI QIDQ4018169
Publication date: 16 January 1993
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/329992
computability theoryarithmetical hierarchynondeterministic machinesBlum-Shub-Smale model of computationclassification of undecidable problems
Descriptive set theory (03E15) Undecidability and degrees of sets of sentences (03D35) Hierarchies of computability and definability (03D55)
Related Items (6)
The foundations of spectral computations via the solvability complexity index hierarchy ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ An explicit solution to Post's problem over the reals ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Real computational universality: the word problem for a class of groups with infinite presentation ⋮ On approximate and algebraic computability over the real numbers
This page was built for publication: The Arithmetical Hierarchy Over the Reals
