undecidable

undecidable

undecidable (not comparable)

1. (mathematics, computing theory) 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 included.
2. (mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)

Altri significati:

(mathematics) ( '''of a WFF''' ) logically independent from the axioms of a given theory; i.e., that it can '''never''' be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. ( '''Note:''' this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)

incapable of being algorithmically decided

(mathematics, computing theory) 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 included.

Incapable of being algorithmically decided in finite time.

Traduzione 'veloce'

Il nostro dizionario è liberamente ispirato al wikidizionario .... The online encyclopedia in which any reasonable person can join us in writing and editing entries on any encyclopedic topic