Re:Church-Turing Thesis Cannot Possibly Be True [video]
by SilasX on Friday October 19, 2018 @01:08PM
(#18258163)
I don't think that's technically correct; I think it would be more correct to say that, for a given natural-number N precision, a Turing machine can calculate sqrt(2) to N precision, and there is no upper bound on N after which a Turing machine can't do it anymore. That's not the same as computing "the exact square root of 2" (only Chuck Norris can do that, of course).
[ Parent
| on HN ]
Re:Church-Turing Thesis Cannot Possibly Be True [video]
by daveFNbuck on Friday October 19, 2018 @05:11PM
(#18260098)
The square root of two cannot be represented exactly in a finite decimal representation, but there are other ways to represent it exactly in finite space. We both know precisely which number we're talking about, despite using computers to represent it.