| "Öö Tiib" <ootiib@hot.ee>: Sep 01 04:34PM -0700 On Monday, 31 August 2020 21:19:09 UTC+3, Keith Thompson wrote: > I encourage anyone in comp.lang.c or comp.lang.c++ who wants to > reply to these posts to take a look at comp.theory, which has been > dominated by these arguments for years. It is unlikely that anyone wants to. Maybe if only Scott Newman will praise those posts as he likes to tease insane people. |
| wyniijj@gmail.com: Sep 01 11:56PM -0700 olcott於 2020年8月31日星期一 UTC+8上午2時56分13秒寫道： > more memory that the physical machine actually has. > -- > Copyright 2020 Pete Olcott ANY programming lannguage is already Turing equivalent language |
| James Kuyper <jameskuyper@alumni.caltech.edu>: Sep 02 09:34AM -0400 On 9/2/20 2:56 AM, wyniijj@gmail.com wrote: ... > ANY programming lannguage is already Turing equivalent language Languages that aren't Turing equivalent do exist, but examples are pretty rare: <https://en.wikipedia.org/wiki/Turing_completeness#Non-Turing-complete_languages> |
| wyniijj@gmail.com: Sep 02 07:24AM -0700 James Kuyper於 2020年9月2日星期三 UTC+8下午9時34分28秒寫道： > Languages that aren't Turing equivalent do exist, but examples are > pretty rare: > <https://en.wikipedia.org/wiki/Turing_completeness#Non-Turing-complete_languages> I know there are series of FPGA, *PROM programming languages, just would not like to type too many to reveal my bad English. |
| boltar@nuttyella.co.uk: Sep 02 03:15PM On Wed, 2 Sep 2020 09:34:14 -0400 >pretty rare: ><https://en.wikipedia.org/wiki/Turing_completeness#Non-Turing-complete_language >s> SQL. |
| olcott <NoOne@NoWhere.com>: Sep 02 12:08PM -0500 >> -- >> Copyright 2020 Pete Olcott > ANY programming lannguage is already Turing equivalent language I now have the means to prove that the x86 language is Turing equivalent by defining a provably Turing equivalent abstract model of computation that the x86 language maps to. The following abstract machine maps the x86 language to machines with a fixed pointer size of the largest unlimited integer address that is actually needed by the computation. Many algorithms could be directly implemented as x86/x64 machines directly equivalent to Turing machines for the same computation. Instruction : INTEGER ":" OpCode | INTEGER ":" OpCode Integer | INTEGER ":" OpCode Integer "," Integer HEXDIGIT [a-fA-F-0-9] INTEGER {HEXDIGIT}+ OPCODE HEXDIGIT{4} Address:OpCode Address:OpCode Param Address:OpCode Param, Param Every "C" prorgam can be mapped to the above model thus proving that "C" is Turing Equivalanet. -- Copyright 2020 Pete Olcott |
| olcott <NoOne@NoWhere.com>: Sep 02 12:27PM -0500 On 9/2/2020 12:22 PM, Kaz Kylheku wrote: > On 2020-09-02, olcott <NoOne@NoWhere.com> wrote: >> This abstract model maps the x86 language to unlimited memory access > Well, the Olcott x86 language, not the Intel x86 language. The Olcott x86 language is a Turing equivalent adaptation of the Intel x86 language that provides the basis for a proof that all Intel x86 programs mapping to the Olcott x86 language are Turing equivalent computations. -- Copyright 2020 Pete Olcott |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment