From 1d3fa85cb49f8374ba11516dcfdd0ce1917fb5f1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Nu=C3=B1o=20Sempere?= Date: Sat, 7 Apr 2018 15:57:19 +0200 Subject: [PATCH] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index cf45943..097c585 100644 --- a/README.md +++ b/README.md @@ -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. + 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. - A Turing Machine that accepts if n doesn't divide m, or if n=m, and rejects otherwise.