next up previous contents
Next: Discussion for next time Up: Church Turing hypothesis Previous: Church Turing hypothesis

Question about functions and computability (Yael)

There are uncountably infinite number of functions, and only a countable infinite number of procedures. This means that there are some functions which can't be computed. This proposition hinges on notion that procedures are finite.