Pages that link to "Item:Q4401926"
From MaRDI portal
The following pages link to Hilbert's Tenth Problem is Unsolvable (Q4401926):
Displaying 50 items.
- A survey on Büchi's problem: new presentations and open problems (Q393235) (← links)
- Diophantine equations and the generalized Riemann hypothesis (Q548056) (← links)
- The analogue of Büchi's problem for function fields (Q555587) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- Diophantine definability and decidability in large subrings of totally real number fields and their totally complex extensions of degree 2 (Q701108) (← links)
- Decidability questions for a ring of Laurent polynomials (Q764281) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Deep learning and k-means clustering in heterotic string vacua with line bundles (Q779316) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- Recursively enumerable sets of polynomials over a finite field (Q875928) (← links)
- Algorithms for sentences over integral domains (Q920964) (← links)
- Inferring answers to queries (Q927868) (← links)
- Diophantine undecidability for some function fields of infinite transcendence degree and positive characteristic (Q937914) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- Rings of algebraic numbers in infinite extensions of \(\mathbb Q\) and elliptic curves retaining their rank (Q1005933) (← links)
- How to build a hypercomputer (Q1036529) (← links)
- Diophantine undecidability of holomorphy rings of function fields of characteristic 0 (Q1041275) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Unification problems with one-sided distributivity (Q1099650) (← links)
- An asymptotic formula for \(\pi\) (Q1115899) (← links)
- Primes are nonnegative values of a polynomial in 10 variables (Q1145721) (← links)
- A new proof of the theorem on exponential diophantine representation of enumerable sets (Q1147132) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- Generic oracles, uniform machines, and codes (Q1184732) (← links)
- Automatic verification of a class of systolic circuits (Q1189257) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- New techniques and results in multidimensional problems (Q1229183) (← links)
- Some decision problems for polynomial mappings (Q1248614) (← links)
- Some nonstationary linear and quasilinear systems occuring in the investigation of the motion of viscous fluids (Q1251139) (← links)
- Factoring numbers in O(log n) arithmetic steps (Q1255313) (← links)
- Existence of noneffectivizable estimates in the theory of exponential Diophantine equations (Q1256452) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- On \(q\)-arithmetic entire functions (Q1275736) (← links)
- The incompleteness of theories of games (Q1277328) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Diophantine undecidability in some rings of algebraic numbers of totally real infinite extensions of \(\mathbb{Q}\) (Q1331916) (← links)
- Diophantine representations of linear recurrences. I (Q1376907) (← links)
- The logic of pseudo-\(S\)-integers (Q1380507) (← links)
- An analogue of Hilbert's 10th problem for fields of meromorphic functions over non-Archimedean valued fields (Q1399671) (← links)
- The Matiyasevich theorem. Preliminaries (Q1795565) (← links)
- LCM of sequences of polynomials (Q1801428) (← links)
- Infiniteness sets of primes, admitting diophantine representations in eight variables (Q1807459) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
