Editing Leonid A. Levin's Contribution to Mathematics

Title: Leonid A. Levin's Contribution to Mathematics

Main Research Question: Can the limitations of mathematical proofs be bypassed to achieve a complete theory of mathematics?

Methodology: Levin proposed a method to extend the universal partial recursive predicate (or Peano Arithmetic) to create a consistent completion of PA (Peano Arithmetic). This method involves creating significant information about a specific math sequence, which is impossible regardless of the methods used.

Results: Levin proved that any such extension either leaves an n-bit input unresolved or contains nearly all information about the n-bit prefix of any r.e.real ρ (which is n-bits for some ρ). He argued that creating significant information about a specific math sequence is impossible, regardless of the methods used.

Implications: Levin's work suggests that creating a complete theory of mathematics beyond the r.e.axioms is impossible. This challenges the idea that all mathematical questions can be answered, and it has implications for other unso-vability results in tasks allowing multiple solutions. His work also contributes to the understanding of the limitations of information and computation.

Link to Article: https://arxiv.org/abs/0203029v19
Authors: 
arXiv ID: 0203029v19

[[Category:Computer Science]]
[[Category:Levin]]
[[Category:Information]]
[[Category:Mathematics]]
[[Category:Creating]]
[[Category:About]]