2 ms·
Not at all. Just because a problem in general is uncomputable does not mean that certain specific instances can't be computed. For example, the halting proble
by pmiller2 17y ago
Not at all. Just because a problem in general is uncomputable does not mean that certain specific instances can't be computed. For example, the halting problem is undecidable, but anyone can see that loop of the form
while (1) { }
is an infinite loop. Undecidability and uncomputability apply only at the level of general problems, not specific instances.
- tectonic 17y agoThanks :)