User blog comment:Ikosarakt1/Symbols function/@comment-7484840-20130707075922/@comment-5150073-20130707103234

This blog post was written back in 05.12.2012, when I didn't even understand Turing machines, and made an attempt to diagonalize over recursion. The number of symbols needed to define symbols function is probably less than 10000, and we get Barry's paradox here.