title: A square root computing turing machine
body: <p>I think i am close to this answer but still to confirm <strong>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.</strong>(whose output would be a real number)
  My logic that we can't develop such a machine is that the real numbers are <strong>uncountably infinite</strong> and for uncountably infinite languages we can't create a turing machine.</p>