On 7/14/2024 2:02 PM, John Clark wrote:
On Sun, Jul 14, 2024 at 4:23 PM Brent Meeker <meekerbr...@gmail.com>
wrote:
/> Every Turing machine can compute whatever is computable...which
means stopping with the answer. /
*
*
*Nonsense!We know everything that a one state Turing machine can due
to a blank input tape *
*because there are only 64 of them, some of them stop and some of them
never do. And w**e know everything that a two state Turing machine can
do to a blank input tape **because there are **20,736** of them.
**20,736 is larger than 64 therefore there must be some things that a
**two state Turing machine can do that a one **state Turing machine
can NOT do.
*
That doesn't follow!
Brent
--
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to everything-list+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/everything-list/e9bbf6db-3053-4ae0-aabb-43122e9b52c0%40gmail.com.
