Abstract
Using Church’s thesis on recursiveness of m-ary relations of integer numbers and methods for existence of solutions for Diophantine equations, the conditions on the computability of some important digital input output models are demonstrated.
Similar content being viewed by others
References
Ciaschini M. (1993) Modelling the structure of the economy. Chapman & Hall, London
Enderton H. B. (1972) A mathematical introduction to logic. Academic Press, New York
Koch H. (2000) Number theory. Algebraic numbers and functions. American Mathematical Society, Providence
Lang, S. (1987). Linear algebra. Third edition. Undergraduate texts in Mathematics. Springer Verlag.
Niven I., Zuckerman H., Montgomery H. (1991) An introduction to the theory of numbers (5th ed.). Wiley, New York
Schmidt W. M. (1991) Diophantine Approximations and Diophantine Equations. Springer Verlag, New York
Smart N. P. (1998) The algorithmic resolution of diophantine equations. Cambridge University Press, Cambridge
Soare R. I. (1987) Recursively enumerable sets and degrees. Springer-Verlag, New York
Velupillae K. V. (2010) Computable foundations for economics. Routledge, London
Velupillae K. V. (2000) Computable economics. Oxford University Press, Oxford
Velupillae V. K. (2005) A primer on the tools and concepts of computable economics. In: Vilupillae V. K. (eds) Computability, complexity and contructivity in economic analysis. Blackwell Publishing, Oxford
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guzmán, J.R. Computability of Digital Input Output Models. Comput Econ 37, 1–11 (2011). https://doi.org/10.1007/s10614-010-9244-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10614-010-9244-9