From adada397b59d7f9be736980ad4ca4007d5a0640d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Nu=C3=B1o=20Sempere?= Date: Sat, 7 Apr 2018 15:58:09 +0200 Subject: [PATCH] Update README.md --- README.md | 2 -- 1 file changed, 2 deletions(-) diff --git a/README.md b/README.md index 097c585..dfa31f5 100644 --- a/README.md +++ b/README.md @@ -5,8 +5,6 @@ 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.