decidable

de·cid·a·ble

D d

Transcription

- US Pronunciation
- US IPA
- UK Pronunciation
- UK IPA
- [dih-sahy-duh-buh l]
- /dɪˈsaɪ də bəl/
- /dɪˈsaɪdəbl /

- US Pronunciation
- US IPA
- [dih-sahy-duh-buh l]
- /dɪˈsaɪ də bəl/

Definitions of decidable word

adjective decidable able to be decided 3
adjective decidable (of a formal theory) having the property that it is possible by a mechanistic procedure to determine whether or not any well-formed formula is a theorem 3
abbreviation Technical meaning of DECIDABLE decidability 3
adjective decidable capable of being decided. 1
adjective decidable Logic. (of an axiom, proposition, etc.) having the property that its consistency or inconsistency with the axioms of a given logical system is determinable. 1
noun Definition of decidable in Technology (mathematics) A property of sets for which one can determine whether something is a member or not in a finite number of computational steps. Decidability is an important concept in computability theory. A set (e.g. "all numbers with a 5 in them") is said to be "decidable" if I can write a program (usually for a Turing Machine) to determine whether a number is in the set and the program will always terminate with an answer YES or NO after a finite number of steps. Most sets you can describe easily are decidable, but there are infinitely many sets so most sets are undecidable, assuming any finite limit on the size (number of instructions or number of states) of our programs. I.e. how ever big you allow your program to be there will always be sets which need a bigger program to decide membership. One example of an undecidable set comes from the halting problem. It turns out that you can encode every program as a number: encode every symbol in the program as a number (001, 002, ...) and then string all the symbol codes together. Then you can create an undecidable set by defining it as the set of all numbers that represent a program that terminates in a finite number of steps. A set can also be "semi-decidable" - there is an algorithm that is guaranteed to return YES if the number is in the set, but if the number is not in the set, it may either return NO or run for ever. The halting problem's set described above is semi-decidable. You decode the given number and run the resulting program. If it terminates the answer is YES. If it never terminates, then neither will the decision algorithm. 1

See all 8 definitions of decidable

Information block about the term

Origin of decidable

First appearance:

before 1585

One of the 35% oldest English words

First recorded in 1585-95; decide + -able

Historical Comparancy

Parts of speech for Decidable

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Decidable

decidable popularity

A pretty common term. Usually people know it’s meaning, but prefer to use a more spread out synonym. About 66% of English native speakers know the meaning and use word.

According to our data about 74% of words is more used. This is a rare but used term. It occurs in the pages of specialized literature and in the speech of educated people.

decidable usage trend in Literature

This diagram is provided by Google Ngram Viewer