Undecidable

Encyclopedia : U : UN : UND : Undecidable

Undecidable has more than one meaning:

A decision problem is called recursively undecidable if no algorithm can decide it, such as for Turings's halting problem; see also under Decidable.
A problem may be undecidable if it cannot be either formally proven or disproven.
"Undecidable" is sometimes used as a synonym of "independent".

This is a [disambiguationdisambiguation] page: a list of articles associated with the same title. If an referred you to this page, you may wish to change the link to point directly to the intended article.

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.