Busy beavers gone wild

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-223815

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.