Is possible to construct a simple program Cnt(V) where V is the parameter .
What the program do is
1)Split the parameter V in N1 and N2
3)goto step 2
I think this is an interesting program because it is possible to construct a computable reduction to a Universal Turing Machine.
Is possible to translate the value N1 to a specific program for a Universal Turing Machine (the programs are recursively enumerable) and it is possible to make bijective correspondence from the value N2 to a step execution of the UTM executing the program so it is also possible to identify an halting state into the program Cnt for every program N1.
Now due to this reduction is possible to identify Cnt as Universal ?