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

Diagonalisation was shown once and assumed familiar ever after

It appeared in the undecidability proof for the halting problem and was then treated as a technique everyone owned. One exposure does not make a technique familiar. Later proofs leaning on it lost most of the room and the lecturer did not notice.
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.