Undecidable

Undecidable

Undecidable has more than one meaning:

;In mathematical logic:
* A decision problem is called (recursively) undecidable if no algorithm can decide it, such as for Turing's halting problem; see also under Decidable and Undecidable problem.
* "Undecidable" is sometimes used as a synonym of "independent", where a formula in mathematical logic is independent of a logical theory if neither that formula nor its negation can be proved within the theory.

;Other uses
* Undecidable figure
* Undecidable language
* Undecidable problem
* Undecidable set

;Also:
*List of undecidable problems

ee also

*Decidable


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • undecidable — adjective a) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are… …   Wiktionary

  • UNDECIDABLE — Martin Davis, The Undecidable, Raven Press, 1965 (informationswissenschaftl. Veoeffentlichung) …   Acronyms

  • UNDECIDABLE — Martin Davis, The Undecidable, Raven Press, 1965 (informationswissenschaftl. Veröffentlichung) …   Acronyms von A bis Z

  • Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any …   Wikipedia

  • undecidable — adj. * * * …   Universalium

  • undecidable — adjective not able to be firmly established or refuted. Derivatives undecidability noun …   English new terms dictionary

  • undecidable — un·decidable …   English syllables

  • undecidable — /ʌndəˈsaɪdəbəl/ (say unduh suyduhbuhl) adjective not decidable. –undecidability /ʌndəsaɪdəˈbɪləti/ (say unduhsuyduh biluhtee), noun …  

  • undecidable — |ən+ adjective : not capable of being decided …   Useful english dictionary

  • On Formally Undecidable Propositions of Principia Mathematica and Related Systems — This article describes the publication details of a famous paper in mathematical logic. For information about the theorems proved in this paper, see Gödel s incompleteness theorems. Über formal unentscheidbare Sätze der Principia Mathematica und… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”