💻MyTuringMachine







💻MyTuringMachine

Turing Machine is a powerful machine that runs purely on binary, and can almost do anything!



Input




Code








FAQ:



Commands:
Each condition consists of 6 characters. 1-3 character represent when the current "memory" is 0, while 4-6 character represent when the current "memory" is 1. It is divided into 2 divisons.
For each divison, the first character is the shift pointer direction operator, the second character is the action operator and the last character is the transit-to operator.
Between each condition, remember to add a ';'.

Shift Pointer Direction Operator:


Left:
L
Right:
R

Action Operator:


Set current "memory" to 0:
0
Set current "memory" to 1:
1
Do nothing to current "memory":
N
Terminate program:
S

Transit-To Operator:


Be reminded that the first condition is 0.
Go to the first condition:
0

Here is an example:
We assume 3 to be 3 consecutive '1's, and 4 to be 4 consecutive '1's.To separate them, we are going to place a '0' between them. So we are going to add those two numbers together by combining them into 1 large consecutive '1's which has 7 '1's.
Input:
1110111100000000
Code:
LN0R01;L12R11;R03L12;LN0RS0
If you still have anything regarding this syntax, feel free to email to sy10236@syss.edu.hk


Did you know that computer science is also an aspect of integrated science? And it is one of the most interesting as well! Wilhelm Schickard, a german professor designed and constructed the first working mechanical calculator in 1623.


Turing deserved the name of being the "Father of Theoretical Computer Science and Artificial Intelligent(AI)". Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Read more.


A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm.
Read more.
Turing Machine
A physical Turing machine model. A true Turing machine would have unlimited tape on both sides, however, physical models can only have a finite amount of tape.




Use #MyTuringMachine to share your ideas built with 💻MyTuringMachine!

Integrated Science Club Social Media:





Website created by Integrated Science Club committee.
Should you have any enquiries, feel free to contact any of our committee members, or sending an email to sy10236@syss.edu.hk
2022-23 Integrated Science Club
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.