News for hackers. Stuff that matters.
Re:Church-Turing Thesis Cannot Possibly Be True [video] by perl4ever on Friday October 19, 2018 @01:24AM (#18254404)
"the value of square root of two can only be approximated by a Turing machine but where ruler-and-compass construction hypothetically can construct this exactly."

Ruler and compass are made of atoms though. Or, if not atoms, planck units or something.

Re:Church-Turing Thesis Cannot Possibly Be True [video] by lisper on Friday October 19, 2018 @01:35AM (#18254429)
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.

Re:Church-Turing Thesis Cannot Possibly Be True [video] by jfoutz on Friday October 19, 2018 @02:15AM (#18254547)
I’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.
Re:Church-Turing Thesis Cannot Possibly Be True [video] by kps on Friday October 19, 2018 @11:50AM (#18257575)
Better to say a Turing machine has unbounded tape. ‘Infinite’ can lead to slippery equivocations.
Re:Church-Turing Thesis Cannot Possibly Be True [video] by MaxBarraclough on Friday October 19, 2018 @05:02AM (#18255271)
Which 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.

Re:Church-Turing Thesis Cannot Possibly Be True [video] by lisper on Friday October 19, 2018 @11:22AM (#18257316)
Actually, a TM tape is unbounded, not infinite. Not the same thing.
Re:Church-Turing Thesis Cannot Possibly Be True [video] by mcguire on Friday October 19, 2018 @10:19AM (#18256883)
Think 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.

Re:Church-Turing Thesis Cannot Possibly Be True [video] by kaibee on Friday October 19, 2018 @10:44AM (#18257037)
That seems to be the same thing as representing sqrt(2) as sqrt(2).
Re:Church-Turing Thesis Cannot Possibly Be True [video] by mcguire on Friday October 19, 2018 @06:59PM (#18260697)
Yes, 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.

Re:Church-Turing Thesis Cannot Possibly Be True [video] by lisper on Friday October 19, 2018 @11:21AM (#18257307)
Yes, exactly my point.