Comment

Comment by Scarblac

It's impressive that a Turing machine of only 10 states can run for Graham's number steps and still halt.

I'd call it absolutely mind boggling, actually.

parent Scarblac 18 days ago

No comments yet

Be the first to share your thoughts.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton