My big question is the following: What is the meaning of a computation being "effectively computable" (EC) in theory and in practice?
In trying to understand these concepts further, I have a couple of sub-questions as well:
Is there a relationship between a computation being EC in theory and being EC in practice? (It seems just by taking the usual meaning of the words, EC in practice should imply EC in theory.)
Is there an example of a computation that is EC in theory but not EC in practice?
How about EC in practice but not EC in theory?
Either explanations or links to where these explanations may be will be helpful.