7 ms·
The square root of 2 can also be computed exactly by a Turing machine. The result is exactly √2. What, that's cheating you say? You wanted an exact decimal e
by lisper 8y ago
The square root of 2 can also be computed exactly by a Turing machine. The result is exactly √2.
What, that's cheating you say? You wanted an exact decimal expansion? Well, you're right, a Turing machine can't produce that. But neither can a ruler and compass.
- jfoutz 8y agoI’m pretty sure a Turing machine has infinite tape. So maybe it can represent that. But you’re going to have to wait a moment for it to print.
- MaxBarraclough 8y agoWhich leads us to a rather trivial conclusion: How many operations will it take to print the infinitely-many digits of the number? Infinity, of course. Same goes for printing 0 to an infinite number of decimal places.
- lisper 8y agoActually, a TM tape is unbounded, not infinite. Not the same thing.
- kps 8y agoBetter to say a Turing machine has unbounded tape. ‘Infinite’ can lead to slippery equivocations.
- mcguire 8y agoThink back to your geometry class. Mathematical geometry works with infinitely small points and has infinite precision. I suspect that the proof is that geometry is uncomputable.
- kaibee 8y agoThat seems to be the same thing as representing sqrt(2) as sqrt(2).
- lisper 8y agoYes, exactly my point.
- mcguire 8y agoYes, sort of. You can "compute" sqrt(2) by the geometric construction of a unit square and "drawing" the diagonal. You cannot do it physically, because marks on paper are not geometric primitives: points are not 0-dimensional; when drawn with a pencil, they have a physical size. A line on paper is not 1-dimensional, etc. But on the other hand, all physical computers are actually equivalent to finite state machines: they don't have infinite (or, unbounded) storage. I'm halfway through the video, and they are discussing this: the fundamental limit of Turing machines, etc., is that they cannot do an infinite (or unbounded) amount of work in a finite number of steps. As a result, geometric constructions a la Euclid are not computable.