The following pages link to (Q3992465):
Displaying 28 items.
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (Q3601323) (← links)
- (Q4231579) (← links)
- Economic Dynamics and Computation—Resurrecting the Icarus Tradition (Q4660038) (← links)
- A reformulation of Hilbert's tenth problem through quantum mechanics (Q4668198) (← links)
- The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem (Q4917999) (← links)
- Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to $\omega(t)$ (Q4987376) (← links)
- The computational complexity of some problems of linear algebra (Q5048945) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- (Q5087790) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- Exponential diophantine equations in rings of positive characteristic (Q5111661) (← links)
- THE EXPONENTIAL DIOPHANTINE PROBLEM FOR (Q5148103) (← links)
- (Q5150520) (← links)
- (Q5150533) (← links)
- (Q5156854) (← links)
- Solving equation systems in ω-categorical algebras (Q5163170) (← links)
- Rational subsets of unitriangular groups (Q5246506) (← links)
- Model Theory in Algebra, Analysis and Arithmetic: A Preface (Q5256620) (← links)
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS (Q5483458) (← links)
- The concept of truth in a finite universe (Q5928928) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Preface (Q5970730) (← links)
- Unsolvability of some problems about piecewise-polynomial functions (Q6052270) (← links)
- Hypergeometric structures in Feynman integrals (Q6059220) (← links)
- Incompleteness of arithmetic from the viewpoint of Diophantine set theory (Q6066029) (← links)
- On polynomial-modular recursive sequences (Q6067835) (← links)
- The Riemann hypothesis as the parity of special binomial coefficients (Q6132479) (← links)
