Rice's Theorem and Algorithmic Undecidability
What does Rice’s Theorem imply about the existence of a universal algorithm capable of detecting infinite loops in any given program?
A
It can be done for programs written in specific languages.
B
It is possible if the program size is limited.
C
It is possible with enough computational power.
D
It is impossible to create such an algorithm.
Question Leaderboard
Not enough data yet to show leaderboard.