steve_bank
Diabetic retinopathy and poor eyesight. Typos ...
Jumping over from the transcendental numbers thread and the last posts. I hd a calss in Theory Of Computation.
en.wikipedia.org
There were paper tape devices far back like the orginal Telertype machnes, so the physcal representation of TM is undestandable.
Hilbet posed a quetion are all mataemtcal truths provable, and I think that was part of theTM gensis.
For an algorithm to be commutable it has to be Turing commutable. No time limit on how long it takes to finish.
A Turing Machine has an infinite paper tape, a read write head that can move the tape and read and write symbols to cells on the tape, and a means to interpret symbols. A PC processor is a Turing Machine without an infinite memory. Paper tape cells become memory locations and the R/W head becoes the processor CPU.
Commutable means being coded on a PC as a generalization.
In a Thery Of Computaion class we sted with lic graohs and trees. There are classes of prblems which can not be solved by travesing grapjs abd trees, one beng oarsing nesteds pateesis. That requires a TM.
Backus-Naur is how computer instruction sets are defined. BNF and context free grammrs are part of compiler design and code gneration. Going from a high level symnbolic languahe like C to assebly language code to bimary machine code.
Compuer languages are all arbitry symbolic defintions.
www.geeksforgeeks.org
en.wikipedia.org
Arurtmetic is a cntext free grammar.
The old 6800 onstruction set.
A lot of theoretxcal dveloment went into the relible kangyages and compiers we take for granted.
Wikipedia, the free encyclopedia
There were paper tape devices far back like the orginal Telertype machnes, so the physcal representation of TM is undestandable.
Hilbet posed a quetion are all mataemtcal truths provable, and I think that was part of theTM gensis.
For an algorithm to be commutable it has to be Turing commutable. No time limit on how long it takes to finish.
A Turing Machine has an infinite paper tape, a read write head that can move the tape and read and write symbols to cells on the tape, and a means to interpret symbols. A PC processor is a Turing Machine without an infinite memory. Paper tape cells become memory locations and the R/W head becoes the processor CPU.
Commutable means being coded on a PC as a generalization.
In a Thery Of Computaion class we sted with lic graohs and trees. There are classes of prblems which can not be solved by travesing grapjs abd trees, one beng oarsing nesteds pateesis. That requires a TM.
Backus-Naur is how computer instruction sets are defined. BNF and context free grammrs are part of compiler design and code gneration. Going from a high level symnbolic languahe like C to assebly language code to bimary machine code.
Compuer languages are all arbitry symbolic defintions.
BNF Notation in Compiler Design - GeeksforGeeks
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
www.geeksforgeeks.org
Context-free grammar - Wikipedia
Arurtmetic is a cntext free grammar.
The old 6800 onstruction set.
6800 instruction set
MC6800 decoding table, full instruction set with description. Addition to my web based MC6800 assembler.
www.8bit-era.cz
A lot of theoretxcal dveloment went into the relible kangyages and compiers we take for granted.