Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_
Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_ Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_
94 the realm of the infinitethat concerns the compression achieved by the informal style in which mathematicalarguments are actually written. This is explored a little bit further in Woodin (1998).With proper inputs and global determination, one could verify with current technologythat a given sequence of length at most 10 24 is a proof of (¬) from ZFC 0 .However, we obviously do not expect to be able to find a sequence of length less than10 24 that is a proof of (¬) from ZFC 0 . This actually gives a prediction about thephysical universe because one can code any candidate for such a sequence by a binarysequence of length at most 10 26 . The point is that, assuming the validity of the quantumview of the world, it is possible to build an actual physical device that must have anonzero chance of finding such a sequence if such a sequence can exist. The devicesimply contains (a suitably large number of independent) modules, each of which performsan independent series of measurements that in effect flips a quantum coin. Thepoint, of course, is that by quantum law any outcome is possible. The prediction issimply that any such device must fail to find a sequence of length less than 10 24 that isa proof of (¬) from ZFC 0 . One may object that the belief that any binary sequenceof length 10 26 is really a possible outcome of such a device requires an extraordinaryfaith in quantum law; but any attempt to build a quantum computer that is useful (forfactoring) requires the analogous claim where 10 26 is replaced by numbers at least aslarge as 10 5 .This, of course, requires something like quantum theory. In the universe as describedby Newtonian laws, the argument just described does not apply because truly randomprocesses would not exist. One could imagine proving that for a large class of chaotic(but deterministic) processes (“mechanical coin flippers”), no binary sequence of length10 24 that actually codes a formal proof can possibly be generated. In other words, forthe nonquantum world, the prediction that no such sequence (as just presented) can begenerated may not require that the conception of V n is meaningful where n =|V 1000 |.Granting quantum law, and based only on our collective experience in mathematicsto date, how can one account for the prediction (that one cannot find a sequence oflength less than 10 24 that is a proof of (¬) from ZFC 0 ) unless one believes that theconception of V n is meaningful where n =|V 1000 |?Arguably (given current physical theory) this is already a conception of a nonphysicalrealm.4.3 Beyond the Finite RealmIn this section we briefly summarize the basic argument of Woodin (2009), althoughhere our use of this argument is for a different purpose.Skeptic’s Attack: The mathematical conception of infinity is meaningless and withoutconsequence because the entire conception of the universe of sets is a complete fiction.Further, all the theorems of set theory are merely finitistic truths, a reflection of themathematician and not of any genuine mathematical “reality.”Throughout this section, the “Skeptic” simply refers to the metamathematical positionthat denies any genuine meaning to a conception of uncountable sets. The counterviewis that of the “Set Theorist.”
- Page 168: a success of set theory 69A fundame
- Page 172: the turing machine and the busy bea
- Page 176: the infinite in the finite: p versu
- Page 180: eferences 75Gamow, G. 1947. One, Tw
- Page 184: possible collapse of contemporary m
- Page 188: possible collapse of contemporary m
- Page 192: possible collapse of contemporary m
- Page 196: possible collapse of contemporary m
- Page 200: possible collapse of contemporary m
- Page 208: CHAPTER 4The Realm of the InfiniteW
- Page 212: the realm of the finite 91Now the c
- Page 216: the realm of the finite 93By the us
- Page 222: 96 the realm of the infinitefor whi
- Page 226: 98 the realm of the infiniteThis mu
- Page 230: 100 the realm of the infiniteMoreov
- Page 234: 102 the realm of the infiniteThis t
- Page 238: 104 the realm of the infinitesets)
- Page 242: 106 the realm of the infinite4.4.1
- Page 246: 108 the realm of the infiniteBut on
- Page 250: 110 the realm of the infiniteTheore
- Page 254: 112 the realm of the infiniteThis a
- Page 258: 114 the realm of the infiniteThe de
- Page 262: 116 the realm of the infiniteSuppos
- Page 266: 118 the realm of the infiniteRefere
94 the realm of the infinitethat concerns the compression achieved by the informal style in which mathematicalarguments are actually written. This is explored a little bit further in <strong>Woodin</strong> (1998).With proper inputs and global determination, one could verify with current technologythat a given sequence of length at most 10 24 is a proof of (¬) from ZFC 0 .However, we obviously do not expect to be able to find a sequence of length less than10 24 that is a proof of (¬) from ZFC 0 . This actually gives a prediction about thephysical universe because one can code any candidate for such a sequence by a binarysequence of length at most 10 26 . The point is that, assuming the validity of the quantumview of the world, it is possible to build an actual physical device that must have anonzero chance of finding such a sequence if such a sequence can exist. The devicesimply contains (a suitably large number of independent) modules, each of which performsan independent series of measurements that in effect flips a quantum coin. Thepoint, of course, is that by quantum law any outcome is possible. The prediction issimply that any such device must fail to find a sequence of length less than 10 24 that isa proof of (¬) from ZFC 0 . One may object that the belief that any binary sequenceof length 10 26 is really a possible outcome of such a device requires an extraordinaryfaith in quantum law; but any attempt to build a quantum computer that is useful (forfactoring) requires the analogous claim where 10 26 is replaced by numbers at least aslarge as 10 5 .This, of course, requires something like quantum theory. In the universe as describedby <strong>New</strong>tonian laws, the argument just described does not apply because truly randomprocesses would not exist. One could imagine proving that for a large class of chaotic(but deterministic) processes (“mechanical coin flippers”), no binary sequence of length10 24 that actually codes a formal proof can possibly be generated. In other words, forthe nonquantum world, the prediction that no such sequence (as just presented) can begenerated may not require that the conception of V n is meaningful where n =|V 1000 |.Granting quantum law, and based only on our collective experience in mathematicsto date, how can one account for the prediction (that one cannot find a sequence oflength less than 10 24 that is a proof of (¬) from ZFC 0 ) unless one believes that theconception of V n is meaningful where n =|V 1000 |?Arguably (given current physical theory) this is already a conception of a nonphysicalrealm.4.3 Beyond the Finite RealmIn this section we briefly summarize the basic argument of <strong>Woodin</strong> (2009), althoughhere our use of this argument is for a different purpose.Skeptic’s Attack: The mathematical conception of infinity is meaningless and withoutconsequence because the entire conception of the universe of sets is a complete fiction.Further, all the theorems of set theory are merely finitistic truths, a reflection of themathematician and not of any genuine mathematical “reality.”Throughout this section, the “Skeptic” simply refers to the metamathematical positionthat denies any genuine meaning to a conception of uncountable sets. The counterviewis that of the “Set Theorist.”