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

Update README.md

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

8
README.md
View File

@ -1,12 +1,12 @@
# 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. I asked my programming teacher how to create a Turing Machine that reaches the nth prime.
He thought I was joking. He thought I was joking.
He was WRONG. He was WRONG.
I never make jokes :) I never make jokes :)
Anyways, to grok how Turing machines, as described in Automata and Computability, by Dexter C. Kozen, work, here are: 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. - A Turing Machine that accepts if a number n doesn't divide another number m and rejects otherwise.
- A Turing Machine that accepts if n doesn't divide m, or if n=m, and rejects otherwise. - A Turing Machine that accepts if n doesn't divide m, or if n=m, and rejects otherwise.