|
A Programmable Prototype to Build Turing Machines | |
| Home | Alan TURING | History | Turing machine | The actual experimental prototype | Some diagrams of Turing machines for this prototype | Presentations | Presse | Simulator | A new machine |
|||||||||
| Machines | Ideas | Description | How the machine operates | Technologies | First Turing machine | Easy | Calculations | Sequences | Interesting | Colleges | University | Talks | Videos | Contact | ||||
| Numerical sequences |
| Build the sequence Un = n in unary 7 states |
 |
 |
 |
||
| Build the sequence Un = n in binary 11 states |
|
 |
 |
||
| Build the sequence Un+1 = Un + 2 in unary 8 states |
|
=U(n)+2_en_unaire_table.jpg) |
=U(n)+2_en_unaire_diagramme.jpg) |
||
| Build the sequence of the powers of 2 in unary 10 states |
|
 |
 |
||
| Passage of the binary system to the Gros-Gray code 2 states |
|
 |
  |
 |
 |
| Passage of the Gros-Gray code to the binary system 2 states |
|
 |
  |
 |
 |
| Build the sequence of numbers written in the Gros-Gray coding system 5 states |
|
 |
 |
||