Forbidden Information

Details Forbidden Information Forbidden Information

2002-03-27

arxiv.org/abs/cs/0203029v16

Computer Science

Computational Complexity

8 pages

Scientific paper

Goedel Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious and involves Kolmogorov complexity. (This is unrelated to, well studied before, complexity quantifications of the usual Goedel effects.) I consider extensions U of the universal partial recursive predicate (or, say, Peano Arithmetic). I prove that any U either leaves an n-bit input (statement) unresolved or contains nearly all information about the n-bit prefix of any r.e. real rho (which is n bits for some rho. I argue that creating significant information about a SPECIFIC math sequence is impossible regardless of the methods used. Similar problems and answers apply to other unsolvability results for tasks allowing non-unique solutions, e.g. non-recursive tilings.

Affiliated with

Also associated with

No associations

Rating

Forbidden Information 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 Forbidden Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forbidden Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-237942