Pages that link to "Item:Q2843817"
From MaRDI portal
The following pages link to Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the modulus of integer solutions, if these solutions form a finite set? (Q2843817):
Displaying 6 items.
- Results and problems on chorded cycles: a survey (Q2102760) (← links)
- On a theorem of Matiyasevich (Q2210378) (← links)
- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235) (← links)
- Recursively enumerable sets of polynomials over a finite field are Diophantine (Q2464706) (← links)
- All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computa (Q2790449) (← links)
- On Diophantine sets over polynomial rings (Q4699593) (← links)
