Pages that link to "Item:Q3734384"
From MaRDI portal
The following pages link to Register machine proof of the theorem on exponential diophantine representation of enumerable sets (Q3734384):
Displayed 27 items.
- Further results on Hilbert's tenth problem (Q829448) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Incompleteness theorems for random reals (Q1105595) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- Information-theoretic incompleteness (Q1200218) (← links)
- LISP program-size complexity. II (Q1200219) (← links)
- Note on the topological structure of random strings (Q1210302) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Metafinite model theory (Q1383163) (← links)
- On the computational power of context-free PC grammar systems (Q1566712) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- The Riemann hypothesis in computer science (Q2286749) (← links)
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation''; and some uncomputable quantum mechanical tasks (Q2497885) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 (Q3030791) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- A Story of Hilbert’s Tenth Problem (Q3305317) (← links)
- The quest for Diophantine finite-fold-ness (Q3383639) (← links)
- Extensions of Hilbert's tenth problem (Q4302340) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- Hilbert's Tenth Problem in Coq (Q5089029) (← links)
- (Q5094119) (← links)
- Metafinite model theory (Q6064289) (← links)
- On the existential arithmetics with addition and bitwise minimum (Q6091188) (← links)
- On some algebraic ways to calculate zeros of the Riemann zeta function (Q6108716) (← links)