Abstract
In the appendix, a brief and introductory survey of selected, relevant results from classical recursion theory is given. The Turing Machine model of computability is made central, but a definition in terms of recursive functions is also discussed. That the two notions of computability and randomness provide the epistemological fulcra for computable economics is emphasized.
Publisher
Oxford University PressOxford