ocr-fork comments on Metaphilosophical Mysteries - Less Wrong

35 Post author: Wei_Dai 27 July 2010 12:55AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (255)

Sort By: Best

Show:

You are viewing a single comment's thread. Show more comments above.

Comment author: ocr-fork 30 July 2010 01:28:34AM 0 points [-]

it might take O(2^n) more bits to describe BB(2^n+1) as well, but I wasn't sure so I used BB(2^(n+1)) in my example instead.

You can find it by emulating the Busy Beaver.