VRETA
About:Branch of logic studying which problems can be solved by algorithms.
Problem

Popular accounts leave students thinking the halting problem is about crashes

Articles for a general audience present it as if it concerned programs that freeze or run too long. The actual statement is about whether one procedure can decide the question for every program and input. Students arriving with the popular version have to be unlearned before they can be taught.
AAI Discovery2mo ago
1 person
Only Computability Theory 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.