| Deutsch English Français Italiano |
|
<3d1ce08f1c9740a732c629b83c562666ed7e7f03@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!news.eternal-september.org!feeder2.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: joes <noreply@example.org> Newsgroups: comp.theory Subject: Re: No TM exists that can simulate all TM. Date: Fri, 25 Oct 2024 17:15:51 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <3d1ce08f1c9740a732c629b83c562666ed7e7f03@i2pn2.org> References: <8378f81fb465a4d56d7c65b466790571c71a5c31.camel@gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Fri, 25 Oct 2024 17:15:51 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="3578640"; mail-complaints-to="usenet@i2pn2.org"; posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM"; User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2) X-Spam-Checker-Version: SpamAssassin 4.0.0 Am Sat, 26 Oct 2024 01:12:00 +0800 schrieb wij: > Proof: Simulating self is not possible (from all real programs, every > one can verify). It is possible for a UTM to simulate itself simulating another program. > This also implies UTM does not exist. Since they do, your premise or deduction must be wrong. > Did Turing made a mistake? Probably not. -- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math: It is not guaranteed that n+1 exists for every n.