A square root computing turing machine
I think i am close to this answer but still to confirm can we create a turing machine(At least in Principle) which can work on real number computation and give exact results.For example finding square root of an integer.
My logic that we can't develop such a machine is that the real numbers are **uncountably infinite** and for uncountably infinite languages we can't create a turing machine.
A square root computing turing machine
===

I think i am close to this answer but still to confirm can we create a turing machine(At least in Principle) which can work on real number computation and give exact results.For example finding square root of an integer.
My logic that we can't develop such a machine is that the real numbers are **uncountably infinite** and for uncountably infinite languages we can't create a turing machine.