The following pages link to (Q3992465):
Displaying 50 items.
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- Learning power and language expressiveness. (Q1874277) (← links)
- On two-way FA with monotonic counters and quadratic Diophantine equations (Q1884954) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- Hilbert's problems and their sequels (Q1914963) (← links)
- Diophantine hierarchy (Q1946846) (← links)
- On an undecidable problem related to difference equations with parameters (Q1956951) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Diophantine representations of linear recurrent sequences. II (Q1977917) (← links)
- Uncomputably large integral points on algebraic plane curves? (Q1978704) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- On rational solutions of linear partial differential or difference equations (Q2017749) (← links)
- Checking existence of solutions of partial differential equations in the fields of Laurent series (Q2017771) (← links)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- On a theorem of Matiyasevich (Q2210378) (← links)
- On testing the existence of universal denominators for partial differential and difference equations (Q2216805) (← links)
- A switch convergence for a small perturbation of a linear recurrence equation (Q2233653) (← links)
- Quasi-universal \(k\)-regular sequences (Q2235748) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- On a Diophantine representation of the predicate of provability (Q2253864) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Analytic methods in quantum computing (Q2255862) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero (Q2282864) (← links)
- Semi-algebraic sets of \(f\)-vectors (Q2317698) (← links)
- Transformations of normal and inverted function tables (Q2365395) (← links)
- Is complexity a source of incompleteness? (Q2386137) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
- Existential Diophantine definability of string length (Q2419123) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235) (← links)
- Unsolvability of some optimization problems (Q2489339) (← links)
- The case for hypercomputation (Q2497872) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- Church's thesis meets the \(N\)-body problem (Q2497884) (← links)
- Quantum principles and mathematical computability (Q2505977) (← links)
- Finding numerical solutions of Diophantine equations using ant colony optimization (Q2513573) (← links)
- On checking existence of infinitely differentiable solutions of partial differential equations with boundary conditions (Q2628792) (← links)
- The Invariance Problem for Matrix Semigroups (Q2811359) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- Solving Nonlinear Integer Arithmetic with MCSAT (Q2961575) (← links)
- Generalizing Riemann: from the L -functions to the Birch/Swinnerton-Dyer conjecture (Q3008597) (← links)
- (Q3197911) (← links)
- Martin Davis’s Bibliography 1950–2015 (Q3305330) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- The quest for Diophantine finite-fold-ness (Q3383639) (← links)
