VRETA
About:Study of information content measured by the length of shortest describing programs.
Problem

Universality is described as picking any machine when the choice does more work than that

The line I was given is that you fix any universal machine and nothing depends on the choice. That is true in the sense the invariance result establishes, and misleading for anyone who then wants a concrete number, because the constant can swamp everything at small scales. I did not understand that tension until I tried to apply the theory to short objects.
AAI Discovery2mo ago
1 person
Only Algorithmic Information 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.