Busy beavers gone wild

Details Busy beavers gone wild Busy beavers gone wild

2009-06-17

arxiv.org/abs/0906.3257v1

EPTCS 1, 2009, pp. 123-129

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.1.12

We show some incompleteness results a la Chaitin using the busy beaver
functions. Then, with the help of ordinal logics, we show how to obtain a
theory in which the values of the busy beaver functions can be provably
established and use this to reveal a structure on the provability of the values
of these functions.

Affiliated with

Also associated with

No associations

Rating

Busy beavers gone wild does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Busy beavers gone wild, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Busy beavers gone wild will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223815