equations with the property of possessing a unique solution. We identify a precise class of
such systems that we call\emph {solvable intitial value problems} and we prove that for this
class of problems the unique solution can always be obtained analytically via transfinite
recursion. We present several examples including a nontrivial one whose solution yields, at
an integer time, a real encoding of the halting set for Turing machines; therefore showcasing …