We can mathematically prove that certain mathematical functions and constants are computable or incomputable. For example, we know that the Busy Beaver function is uncomputable, but that arithmetic is computable.
Are there any functions for which their computability has been proven uncomputable, and if so, what are some examples and is there any term for such a function?
I’ve been following people like Jonathan Blow, as well as Paul Graham. I’ve learned Lisp and kind of like it, but I’ve heard Jonathan Blow say that A) GC is bad, and B) not to use Lisp and other similar languages. Could you explain these reasons not to use Lisp/higher-level languages with more features?
