The following pages link to Universal diophantine equation (Q3953760):
Displaying 32 items.
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Linear equations over multiplicative groups, recurrences, and mixing. II (Q475577) (← links)
- Knapsack problem for nilpotent groups (Q524650) (← links)
- What can and cannot be done with Diophantine problems (Q741171) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- My collaboration with Julia Robinson (Q1208619) (← links)
- The incompleteness of theories of games (Q1277328) (← links)
- On the computability of Nash equilibria (Q1391660) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Infiniteness sets of primes, admitting diophantine representations in eight variables (Q1807459) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Uncomputably large integral points on algebraic plane curves? (Q1978704) (← links)
- Prime representing polynomial (Q2171524) (← links)
- On a Diophantine representation of the predicate of provability (Q2253864) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Diophantine complexity (Q2276953) (← links)
- Semi-algebraic sets of \(f\)-vectors (Q2317698) (← links)
- (Q2777515) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Comparison of max-plus automata and joint spectral radius of tropical matrices (Q5111233) (← links)
- (Q5150520) (← links)
- (Q5150533) (← links)
- Primality testing (Q5903157) (← links)
- Undecidable problems in quantum field theory (Q6049665) (← links)
- The Riemann hypothesis as the parity of special binomial coefficients (Q6132479) (← links)
- Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования (Q6167582) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
- Several remarks on tensor rank computation (Q6671381) (← links)
