Undecidable problem
id:
undecidable-problem-173-16943336
title:
Undecidable problem
text:
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.
brand slug:
wiki
category slug:
encyclopedia
description:
Yes-or-no question that cannot ever be solved by a computer
original url:
https://en.wikipedia.org/wiki/Undecidable_problem
date created:
2008-02-07T00:09:23Z
date modified:
2024-09-02T13:51:52Z
main entity:
{"identifier":"Q3502995","url":"https://www.wikidata.org/entity/Q3502995"}
image:
fields total:
13
integrity:
15