Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

BB(748) is a natural number, and _all_ natural numbers are computable.


There is definitely a function f such that f() = n for all n ∈ ℕ.

But there is also a function g that you cannot prove whether g() = n.

Important distinction.

This means that somebody could claim that the value of BB(748) = n but you cannot be sure if they are correct (but you might be able to show they are wrong).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: