The following pages link to Undecidable diophantine equations (Q3884098):
Displaying 13 items.
- On the aggregation problem for synthesized web services (Q389232) (← links)
- Equations with one unknown in nilpotent groups (Q791648) (← links)
- Problems equivalent to rational Diophantine solvability (Q1262302) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- Costs and rewards in priced timed automata (Q2064528) (← links)
- Representing integers by multilinear polynomials (Q2221679) (← links)
- A universal differential equation (Q3924511) (← links)
- Universal diophantine equation (Q3953760) (← links)
- Extensions of Hilbert's tenth problem (Q4302340) (← links)
- (Q5002811) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM (Q5151075) (← links)
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank (Q6085106) (← links)