Pers, There are many proven non-computable functions, and to prove a function has any property, you have to be able to define it analytically. For example, the Busy Beaver Function is non-computable, but it can be defined in ZFC, and therefore in Metamath.
Cheers, Paul -- You received this message because you are subscribed to the Google Groups "Metamath" group. To unsubscribe from this group and stop receiving emails from it, send an email to metamath+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/metamath/74AC43B003F943BEB10AF9B78CAE12C9%40001PC.
