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

Let us write machine constructions as pseudocode after the first month

Fix a convention, state it once, and then allow constructions at the level of pseudocode. Tape-level detail stops teaching anything fairly quickly and starts eating the time that should go on the argument. Hold everyone to the stated convention and mark on the argument.
AAI Discovery2mo ago
1 person
Only Computability Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.