Pages that link to "Item:Q3986352"
From MaRDI portal
The following pages link to Proof of Recursive Unsolvability of Hilbert's Tenth Problem (Q3986352):
Displaying 13 items.
- Information-theoretic incompleteness (Q1200218) (← links)
- LISP program-size complexity. II (Q1200219) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Pell equations and exponentiation in fragments of arithmetic (Q1919524) (← links)
- Iterative arrays with finite inter-cell communication (Q2278566) (← links)
- (Q2777515) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- Two conjectures on the arithmetic in ℝ and ℂ (Q3552394) (← links)
- Questions of decidability and undecidability in Number Theory (Q4302339) (← links)
- An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms (Q5244858) (← links)
- An open formalism against incompleteness (Q5937853) (← links)
