personal/Turing_Machine
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Create README.md

Browse Source
This commit is contained in:
Nuño Sempere 2018-04-06 07:28:40 +02:00 committed by GitHub
commit a2c678f830
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
README.md Normal file
View File

@ -0,0 +1,15 @@
# Turing_Machine
Are you interested in project based learning?
No, I'm interested in learning based projecting.
I asked my programming teacher how to create a Turing Machine that reaches the nth prime.
He thought I was joking.
He was WRONG.
I never make jokes :)
Anyways, to grok how Turing machines, as described in Automata and Computability, by Dexter C. Kozen, work, here are:
- A Turing Machine that accepts if a number n doesn't divide another number m and rejects otherwise.
Its input should be: a 0, followed by (n-1) 1s followed by an 8, followed by (m-1) 2s followed by a 9.
- A Turing Machine that detects whether a number >=2 is prime.
Its input should be: a 0, followed by a 1, followed by an 8, followed [...]
The input for