Pages that link to "Item:Q2445235"
From MaRDI portal
The following pages link to Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235):
Displaying 7 items.
- Towards finite-fold Diophantine representations (Q393229) (← links)
- Results and problems on chorded cycles: a survey (Q2102760) (← links)
- Diophantine sets of representations (Q2445923) (← 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)
- 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) (← links)
- A new characterization of computable functions (Q2922764) (← links)
- Joining non-low C.E. sets with diagonally non-computable functions (Q5406113) (← links)
