| olcott <NoOne@NoWhere.com>: Sep 03 04:16PM -0500 On 9/3/2020 3:28 PM, olcott wrote: > input, deriving equivalent output and having the same halting behavior. > My H_Hat correctly decides halting for many variations of itself and > many other programs that are not variations of H_Hat. My H_Hat equivalent is implemented as a UTM equivalent such that H_Hat executes itself (or any other UTM or TM equivalent) in Debug-step mode. It is the Debug_Step(master_state, slave_state) virtual machine instruction that converts any TM equivalent into a UTM equivalent. The master UTM equivalent can examine the state of the slave UTM equivalent after every Debug_Step() is executed. The x86 language (plus four virtual machine instructions) comprised the entire UTM equivalent description language. // allocates memory from Heap_Space. [A] u32* Allocate(u32 size); // executes a slave UTM in single step debug mode [B] u32 Debug_Step(u32* master_state, u32* slave_state); // Saves the execution state of a UTM to state_data [C] u32 Save_State(u32* state_data); // Loads the execution state of a UTM from state_data [D] u32 Load_State(u32* state_data); My x86 based UTM equivalent can directly execute the COFF object files generated by the Microsoft "C" compilers. This lets me write my H_Hat equivalent in "C". -- Copyright 2020 Pete Olcott |
| olcott <NoOne@NoWhere.com>: Sep 02 11:00PM -0500 When we map "C" to a Turing equivalent abstract model of compuation "C" becomes Turing equivalent. Mapping x86 programs to a Turing equivalent abstract model 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. 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 All Intel x86/x64 programs that map to the above abstract model of computation would be provably Turing equivalent computations. This means that they would always produce equivalent output for equivalent input and have the same halting behavior. -- Copyright 2020 Pete Olcott |
| Keith Thompson <Keith.S.Thompson+u@gmail.com>: Sep 02 11:22PM -0700 > computation would be provably Turing equivalent computations. This > means that they would always produce equivalent output for equivalent > input and have the same halting behavior. Since you don't even mention C++, please don't cross-post this to comp.lang.c++. This: HEXDIGIT [a-fA-F-0-9] should be: HEXDIGIT [a-fA-F0-9] -- Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com Working, but not speaking, for Philips Healthcare void Void(void) { Void(); } /* The recursive call of the void */ |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Sep 02 08:44PM -0700 On 8/26/2020 3:11 PM, Ian Collins wrote: >> ;^) Try to get the following running at 60fps on a 1.5mhz 6809 CPU: >> https://www.shadertoy.com/view/XtscDl > Nice! Check this out: https://youtu.be/BUbMJJyj7AU https://youtu.be/P_lAP4IiYyE My spider attractor... |
| 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