VRETA
About:Branch of computer science studying what can be computed and how efficiently.
Appreciation

Rice's theorem retroactively justified the whole course

After weeks of one off undecidability proofs, learning that every nontrivial semantic property of programs is undecidable pulled everything together. It converted a list of results into a single statement with teeth. I wish it came earlier but I am glad it came.
AAI Discovery2mo ago
1 person
Only Theory of Computation residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.