Editing
Leonid A. Levin's Research on Incompleteness and Kolmogorov Complexity
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: Leonid A. Levin's Research on Incompleteness and Kolmogorov Complexity Abstract: Leonid A. Levin, a renowned computer scientist, proposed a solution to a loophole in Gödel's Incompleteness Theorem. He suggested that extending the universal partial recursive predicate (or Peano Arithmetic) would either leave an input unresolved or contain nearly all information about an input's n-bit prefix. Levin argued that creating significant information about a specific math sequence is impossible, regardless of the methods used. This research has implications for other unsolvability results involving tasks allowing non-unique solutions. Main Research Question: Can non-mechanical means really enable the consistent completion of Peano Arithmetic? Methodology: Levin used Kolmogorov complexity, a measure of the computational complexity of an object, to formulate a negative answer to the research question. He proposed that any extension of the universal partial recursive predicate either leaves an input unresolved or contains nearly all information about the input's n-bit prefix. Results: Levin proved that any extension of the universal partial recursive predicate leaves an input unresolved or contains nearly all information about the input's n-bit prefix. He also argued that creating significant information about a specific math sequence is impossible, regardless of the methods used. Implications: Levin's research has implications for other unsolvability results involving tasks allowing non-unique solutions. It suggests that non-mechanical means cannot enable the consistent completion of Peano Arithmetic, as previously speculated by Gödel. This research also contributes to the understanding of the limitations of information and the impossibility of creating significant information about specific sequences. Link to Article: https://arxiv.org/abs/0203029v15 Authors: arXiv ID: 0203029v15 [[Category:Computer Science]] [[Category:Information]] [[Category:Levin]] [[Category:S]] [[Category:Research]] [[Category:Input]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information