VRETA
About:Length of the shortest program that produces a given string as output.
Problem

Half the students who enrol think they signed up for P versus NP

The course catalogue entry has the word complexity in it and nothing else that distinguishes it, so every term a group arrives expecting running times and hardness classes. What they get is description length, incomputability and an invariance argument. Several drop in week two, and the ones who stay spend a while unlearning the wrong mental model.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity 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.