Rice’s Theorem is a very powerful and yet easy to use tool in every Computer Scientists arsenal. It states Every non-trivial, semantic property of an algorithm is undecidable. Reading this theorem begs the question: What exactly is a non-trivial property? This question is best answered by thinking of trivial properties […]
Theoretical Computer Science
1 post