A non-computable isa problem for which there is no algorithm that can be used to solve it. Most famous example of a non-computablity (or undecidability) is the Halting Problem. What is On Computable Numbers about? Undoubtedly the most famous theoretical paper in the history of computing, "O...