What is Incompleteness Theorem? - Definition from WhatIs.com

Definition

Incompleteness Theorem

Part of the Computing fundamentals glossary:

The Incompleteness Theorem is a pair of logical proofs that revolutionized mathematics. The first result was published by Kurt Gödel (1906-1978) in 1931 when he was 24 years old.

The First Incompleteness Theorem states that any contradiction-free rendition of number theory (a branch of mathematics dealing with the nature and behavior of numbers and number systems) contains propositions that cannot be proven either true or false on the basis of its own postulates. The Second Incompleteness Theorem states that if a theory of numbers is contradiction-free, then this fact cannot be proven with common reasoning methods.

Some mathematicians found Gödel's proofs disturbing when they were published. Today, serious students of mathematical logic find them fascinating. Some people have seized upon Gödel's results and attempted to apply them to nature in general, to social science, and even to theology. Many of these extensions of Gödel's results are inappropriate; a few are, by scientific standards, ridiculous.

Kurt Gödel was born in the Czech Republic and grew up in Austria (which was the Austro-Hungarian Empire in Gödel's early childhood). His primary language was German. Although he is most famous for his contribution to mathematical logic, he also did much work in set theory . He was a friend of Albert Einstein during the time they were both at the Institute for Advanced Study at Princeton University

This was last updated in September 2005
Posted by: Margaret Rouse

Related Terms

Definitions

  • IS (information system or information services)

    - An information system (IS) is the collection of technical and human resources that provide the storage, computing, distribution, and communication for the information required by all or some part o... (WhatIs.com)

  • distributed

    - Computing is said to be "distributed" when the computer programming and data that computers work on are spread out over more than one computer, usually over a network.Cloud computing is a particula... (WhatIs.com)

  • greedy algorithm

    - A greedy algorithm is a mathematical process that looks for simple, easy-to-implement solutions to complex, multi-step problems by deciding which next step will provide the most obvious benefit. (WhatIs.com)

Glossaries

  • Computing fundamentals

    - Terms related to computer fundamentals, including computer hardware definitions and words and phrases about software, operating systems, peripherals and troubleshooting.

  • Internet applications

    - This WhatIs.com glossary contains terms related to Internet applications, including definitions about Software as a Service (SaaS) delivery models and words and phrases about web sites, e-commerce ...

Ask a Question About Incompleteness TheoremPowered by ITKnowledgeExchange.com

Get answers from your peers on your most technical challenges

Tech TalkComment

Share
Comments

    Results

    Contribute to the conversation

    All fields are required. Comments will appear at the bottom of the article.