A blog about imaginary typology in imaginary languages.
What is the hardest computational complexity class for which a script for which parsing is a "complete" problem still be humanly readable?
No comments:
Post a Comment