Skip to main content
Computer Science

Return to Answer

replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
Source Link
Community Bot
Community Bot
  • 1

No. That would allow you to determine the runtime of any given (recursive) program (assuming it always terminates), but that is not a computable problemthat is not a computable problem.

No. That would allow you to determine the runtime of any given (recursive) program (assuming it always terminates), but that is not a computable problem.

No. That would allow you to determine the runtime of any given (recursive) program (assuming it always terminates), but that is not a computable problem.

added 12 characters in body
Source Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393

No. That would allow you to determine the runtime of any given (recursive) program (assuming it always terminates), but that is not a computable problem.

No. That would allow you to determine the runtime of any given program (assuming it always terminates), but that is not a computable problem.

No. That would allow you to determine the runtime of any given (recursive) program (assuming it always terminates), but that is not a computable problem.

Source Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393

No. That would allow you to determine the runtime of any given program (assuming it always terminates), but that is not a computable problem.