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

Diagonalisation appears three times and is never named as a technique

It shows up for uncountability, for the halting problem and again for a hierarchy result, each time presented as a local trick. Nobody stepped back and said this is one method with a shape you can recognise. I only saw the pattern afterwards, from a different book.
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.