←back to thread

BusyBeaver(6) Is Quite Large

(scottaaronson.blog)
272 points bdr | 1 comments | | HN request time: 0.21s | source
Show context
phs ◴[] No.44407483[source]
So what is the richest logic whose proofs can be enumerated with only a five state TM?
replies(2): >>44407624 #>>44410048 #
1. tromp ◴[] No.44407624[source]
That entirely depends on how you want to interpret a finite binary string as an enumeration of logic proofs?!