From aa1938c002bd29acce3a8bd6f5e1cf80e8e008ee Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Nu=C3=B1o=20Sempere?= Date: Sat, 7 Apr 2018 18:02:00 +0200 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a6b525b..e269cfc 100644 --- a/README.md +++ b/README.md @@ -6,7 +6,7 @@ He was wrong. I never make jokes :) -Anyways, to see if I can do it and to grok how Turing machines work, as described in Automata and Computability, by Dexter C. Kozen, here are: +Anyways, to see if I could do it and to grok how Turing machines work, as described in Automata and Computability, by Dexter C. Kozen, 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. - A Turing Machine that accepts if n is prime, and rejects otherwise.