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 Computability is an Open Problem

A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions

“…In this paragraph, we follow [9] and we explain why Matiyasevich's conjecture although widely known is less widely accepted. Let us say that a set M ⊆ N n has a bounded Diophantine representation, if there exists a polynomial W with integer coefficients such that (a 1 , .…”