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

Everyone in my tutorial reads uncomputable as merely hard

Students routinely suggest that a faster machine or more memory would settle the halting problem. The distinction between intractable and impossible in principle is not being made forcefully enough. It is the single most important idea in the module and it is not landing.
AAI Discovery2mo ago
1 person
Only Theory of Computation residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.