An explicit solution to Post's problem over the reals
From MaRDI portal
Recommendations
- Fundamentals of Computation Theory
- scientific article; zbMATH DE number 65647
- Publication:4729772
- Two \(P\)-complete problems in the theory of the reals
- scientific article; zbMATH DE number 176763
- On the solvability of the positive real lemma equations.
- A completion problem over the field of real numbers
- A continuous, constructive solution to Hilbert's \(17^{th}\) problem
- On the constructive Dedekind reals
- A Wronskian approach to the real \(\tau\)-conjecture
Cites work
- scientific article; zbMATH DE number 1670874 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1220163 (Why is no real title available?)
- scientific article; zbMATH DE number 1994508 (Why is no real title available?)
- scientific article; zbMATH DE number 233957 (Why is no real title available?)
- scientific article; zbMATH DE number 3238722 (Why is no real title available?)
- A note on non-complete problems in \(NP_\mathbb{R}\)
- A survey on real structural complexity theory
- A uniform approach to obtain diagonal sets in complexity classes
- Algorithms in real algebraic geometry
- Classical physics and the Church--Turing Thesis
- Completeness and reduction in algebraic complexity theory
- Computability Over Arbitrary Fields
- Computing over the reals with addition and order
- Computing over the reals with addition and order: Higher complexity classes
- Existence and Uniqueness of Interpolating Rational Functions
- Hypercomputation with quantum adiabatic processes
- Irreducible polynomials with integral coefficients have succinct certificates
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Linear Independence of Fractional Powers of Integers
- On the Structure of $\cal NP_\Bbb C$
- On the Structure of Polynomial Time Reducibility
- Post's problem for supertasks has both positive and negative solutions
- Real number models under various sets of operations
- Recursively enumerable sets of positive integers and their decision problems
- Saturation and stability in the theory of computation over the reals
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- The Arithmetical Hierarchy Over the Reals
Cited in
(13)- Some initial thoughts on bounded query computations over the reals
- Computation over algebraic structures and a classification of undecidable problems
- Logical Approaches to Computational Barriers
- 2010 North American Annual Meeting of the Association for Symbolic Logic
- Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen
- Real computational universality: the word problem for a class of groups with infinite presentation
- A hierarchy below the halting problem for additive machines
- A topological view on algebraic computation models
- The cardinality of an oracle in Blum-Shub-Smale computation
- Computational processes, observers and Turing incompleteness
- Generalized finite automata over real and complex numbers
- Post's problem for supertasks has both positive and negative solutions
- Fundamentals of Computation Theory
This page was built for publication: An explicit solution to Post's problem over the reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479313)
