Hello all, I know the definition of recursion functions. I am unclear about the concept of computability. Wouldn't any function we can write down be recursive? Could someone give me a function that is not recursive (not computable). I would have thought any function that can be written as an expression (analytic expression) would be recursive/computable. Please clarify Pers
-- 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/25e02769-51d5-4341-995e-f1c6387c8bd6%40googlegroups.com.