The bounded halting problem is decidable. Why doesn't this conflict with Rice's theorem? – cs.stackexchange.com

The bounded halting problem is decidable. Why doesn't this conflict with Rice's theorem? – cs.stackexchange.com

03:11 No Comments
One statement of Rice's theorem is given on page 35 of "Computational Complexity: a Modern Approach" (Arora-Barak): A partial function from $\{0,1\}^*$ to $\{0,1\}^*$ is a function that is not ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "The bounded halting problem is decidable. Why doesn't this conflict with Rice's theorem? – cs.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)