Abstract
This paper takes the first steps in developing a theory of “explicit finitism” which puts explicit limits on the size of finite objects. We provide motivation in the “physics of computation” sense, survey some of the difficulties and describe the appropriate computing machinery. We introduce the subset J of the real numbers that is the central mathematical object emerging from considerations of explicit finitism, and take the first steps in studying its properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Friedman, H. (1999). Enormous Integers in Real Life. www.math.ohio-state.edu/foundationslct/ EnormousInt.12pt.6_1_00.doc
Lloyd, S. (2002). Computational capacity of the universe. Physical Review Letters 88, 237901.
Montague, R. (1974). Deterministic theories. In Formal Philosophy, pp. 303-360, R. H. Thomason, ed., Yale University Press, New Haven, CT.
Raatikainen, P. (1998). On interpreting Chaitin's incompleteness theorem. Journal of Philosophical Logic 27, 569-586.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kornai, A. Explicit Finitism. International Journal of Theoretical Physics 42, 301–307 (2003). https://doi.org/10.1023/A:1024451401255
Issue Date:
DOI: https://doi.org/10.1023/A:1024451401255