https://robustlybeneficial.org/wiki/index.php?action=history&feed=atom&title=Church-Turing_thesis 2026-04-28T15:21:48Z Revision history for this page on the wiki MediaWiki 1.34.0 https://robustlybeneficial.org/wiki/index.php?title=Church-Turing_thesis&diff=199&oldid=prev 2020-02-04T16:03:19Z

<p></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 16:03, 4 February 2020</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>The Church-Turing thesis claims that the universal Turing machine is the most general form of computation.</div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>The Church-Turing thesis claims that the universal Turing machine is the most general form of computation <ins class="diffchange diffchange-inline">[https://www.youtube.com/watch?v=PLVCscCY4xI UpAndAtom20]</ins>.</div></td></tr> <tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== The different versions of the thesis ==</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== The different versions of the thesis ==</div></td></tr> </table>

Lê Nguyên Hoang https://robustlybeneficial.org/wiki/index.php?title=Church-Turing_thesis&diff=16&oldid=prev 2020-01-20T21:30:01Z

<p>Created page with &quot;The Church-Turing thesis claims that the universal Turing machine is the most general form of computation. == The different versions of the thesis == There are several sligh...&quot;</p> <p><b>New page</b></p><div>The Church-Turing thesis claims that the universal Turing machine is the most general form of computation.<br /> <br /> == The different versions of the thesis ==<br /> <br /> There are several slightly distinct versions of this thesis.<br /> <br /> Perhaps the most important one is to claim that it is the most general form of computation of any machine that can be built in our universe. In particular, this would mean that the &lt;em&gt;halting problem&lt;/em&gt; cannot be solved in our space-time.<br /> <br /> The &lt;em&gt;computational complexity Church-Turing thesis&lt;/em&gt; is widely believed to be wrong, because of quantum mechanics. But it can be upgraded to a &lt;em&gt;quantum complexity Church-Turing thesis&lt;/em&gt;.<br /> <br /> == Justifications from physics ==<br /> <br /> Gandy theorem.<br /> <br /> Bekenstein bound.<br /> <br /> [https://arxiv.org/pdf/quant-ph/0110141.pdf Lloyd][https://scholar.google.ch/scholar?hl=en&amp;as_sdt=0%2C5&amp;q=Computational+capacity+of+the+universe+lloyd&amp;btnG= 02] estimate computational capacity measures of the universe.<br /> <br /> == Implications ==<br /> <br /> It's all about information and information processing!<br /> <br /> No &quot;fundamental law&quot; of physics. Any universal Turing machine is.<br /> <br /> Nothing special about intelligence.<br /> <br /> Computational moral philosophy.</div>

Lê Nguyên Hoang