> Undecidability requires infinities. As does the Turing machine itself, or any other turing complete computation model for that matter. Heck, even the study

> Undecidability requires infinities. As does the Turing machine itself, or any other turing complete computation model for that matter. Heck, even the study of computational complexity forces you to accept some arbitrarily large value of n, which implies any fixed finite storage capacity is unacceptably small. Modern programming does a pretty good job at approximating infinite memory (by using the cloud as a data store)