Very large databases are a major opportunity for science and data analytics is a remarkable new field of investigation in computer science. The effectiveness of these tools is used to support a “philosophy” against the scientific method as developed throughout history. According to this view, computer-discovered correlations should replace understanding and guide prediction and action. Consequently, there will be no need to give scientific meaning to phenomena, by proposing, say, causal relations, since regularities in very large databases are enough: “with (...) enough data, the numbers speak for themselves”. The “end of science” is proclaimed. Using classical results from ergodic theory, Ramsey theory and algorithmic information theory, we show that this “philosophy” is wrong. For example, we prove that very large databases have to contain arbitrary correlations. These correlations appear only due to the size, not the nature, of data. They can be found in “randomly” generated, large enough databases, which—as we will prove—implies that most correlations are spurious. Too much information tends to behave like very little information. The scientific method can be enriched by computer mining in immense databases, but not replaced by it. (shrink)
In this paper we consider the possibility of a Quantum Molinism : such a view applies an analogue of the Molinistic account of free will‘s compatibility with God’s foreknowledge to God’s knowledge of (supposedly) indeterministic events at a quantum level. W e ask how (and why) a providential God could care for and know about a world with this kind of indeterminacy. We consider various formulations of such a Quantum Molinism, and after rejecting a number of options arrive at one (...) seemingly coherent formulation. (shrink)
If is a random sequence, then the sequence is clearly not random; however, seems to be “about half random”. L. Staiger [Kolmogorov complexity and Hausdorff dimension, Inform. and Comput. 103 159–194 and A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst. 31 215–229] and K. Tadaki [A generalisation of Chaitin’s halting probability Ω and halting self-similar sets, Hokkaido Math. J. 31 219–253] have studied the degree of randomness of sequences or reals by measuring their “degree (...) of compression”. This line of study leads to various definitions of partial randomness. In this paper we explore some relations between these definitions. Among other results we obtain a characterisation of Σ1-dimension in terms of strong Martin-Löf ε-tests , and we show that ε-randomness for ε is different than the classical 1-randomness. (shrink)
We study some aspects of the emergence of _lógos_ from _xáos_ on a basal model of the universe using methods and techniques from algorithmic information and Ramsey theories. Thereby an intrinsic and unusual mixture of meaningful and spurious, emerging laws surfaces. The spurious, emergent laws abound, they can be found almost everywhere. In accord with the ancient Greek theogony one could say that _lógos_, the Gods and the laws of the universe, originate from “the void,„ or from _xáos_, a picture (...) which supports the unresolvable/irreducible lawless hypothesis. The analysis presented in this paper suggests that the “laws„ discovered in science correspond merely to syntactical correlations, are local and not universal. (shrink)
Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Rephrased, How far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result of Kochen and Specker answers the above question in the negative. However, this answer is just one among various possible ones, not all negative. It is our aim to discuss the above question in terms of mappings of quantum worlds into classical ones, (...) more specifically, in terms of embeddings of quantum logics into classical logics; depending upon the type of restrictions imposed on embeddings, the question may get negative or positive answers. (shrink)
Recently, G. ASSER has obtained two interesting characterizations of the class of unary primitive recursive string-functions over a fixed alphabet as Robinson algebras. Both characterizations use a somewhat artificial string-function, namely the string-function lexicographically associated with the number-theoretical excess-over-a-square function. Our aim is to offer two new and natural Robinson algebras which are equivalent to ASSER’S algebras.
Turing’s famous 1936 paper “On computable numbers, with an application to the Entscheidungsproblem” defines a computable real number and uses Cantor’s diagonal argument to exhibit an uncomputable real. Roughly speaking, a computable real is one that one can calculate digit by digit, that there is an algorithm for approximating as closely as one may wish. All the reals one normally encounters in analysis are computable, like π, √2 and e. But they are much scarcer than the uncomputable reals because, as (...) Turing points out, the computable reals are countable, whilst the uncomputable reals have the power of the continuum. Furthermore, any countable set of reals has measure zero, so the computable reals have measure zero. In other words, if one picks a real at random in the unit interval with uniform probability distribution, the probability of obtaining an uncomputable real is unity. One may obtain a computable real, but that is in- finitely improbable. But how about individual examples of uncomputable reals? We will show two: H and the halting probability Ω, both contained in the unit interval. Their construction was anticipated in.. (shrink)
We present an abstract framework in which we give simple proofs for Gödel’s First and Second Incompleteness Theorems and obtain, as consequences, Davis’, Chaitin’s and Kritchman-Raz’s Theorems.
Gödel's Incompleteness Theorems have the same scientific status as Einstein's principle of relativity, Heisenberg's uncertainty principle, and Watson and Crick's double helix model of DNA. Our aim is to discuss some new faces of the incompleteness phenomenon unveiled by an information-theoretic approach to randomness and recent developments in quantum computing.
The fourthDiscrete Mathematics andTheoreticalComputer Science Conference was jointly organized by the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland and the University of Bourgogne in Dijon, France, and took place in Dijon from 7 to12 July2003.Thepreviousconferenceswereheld inAuckland,NewZealand and Constan ̧ ta, Romania. The?ve invited speakers of the conference were: G.J. Chaitin, C. Ding, S. Istrail, M. Margenstein, and T. Walsh. The Programme Committee, consisting of V. Berthe, S. Boza- lidis,C.S.Calude,V.E.Cazanescu, F. Cucker, M. Deza, J. Diaz, (...) M.J. D- neen,B.Durand,L.Hemaspaandra, P. Hertling, J. Kohlas, G. Markowski, M. Mitrovic, A. Salomaa, L. Staiger, D. Skordev, G. Slutzki, I. Tomescu, M. Yasugi, and V. Vajnovszki, selected 18 papers to be presented as regular contributions and 1 5 other special CDMTCS papers. (shrink)
Suppose that persons A and B give us a sequence of 32 bits each, saying that they were obtained from independent coin flips. If A gives the stringu = 01001110100111101001101001110101and B gives the stringv = 00000000000000000000000000000000,then we would tend to believe A and would not believe B: the string u seems to be random, but the string v does not. Further on, if we change the value of a bit in a “random” string, then the result is still a “random” (...) string. If we keep making such changes in a “random” string, then we will eventually complete destroy randomness. (shrink)
The present paper proposes a generalisation of the notion of disjunctive sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F. We show that a definition like “every subword which occurs at infinitely many different positions in sequences in F has to occur infinitely often in the sequence” fulfils properties similar to the original unrelativised notion of (...) disjunctiveness. Finally, we investigate our concept of generalised disjunctiveness in spaces of Cantor expansions of reals. (shrink)
We prove that every computably enumerable random real is provable in Peano Arithmetic to be c.e. random. A major step in the proof is to show that the theorem stating that “a real is c.e. and random iff it is the halting probability of a universal prefix-free Turing machine” can be proven in PA. Our proof, which is simpler than the standard one, can also be used for the original theorem. Our positive result can be contrasted with the case of (...) computable functions, where not every computable function is provably computable in PA, or even more interestingly, with the fact that almost all random finite strings are not provably random in PA. We also prove two negative results: a) there exists a universal machine whose universality cannot be proved in PA, b) there exists a universal machine U such that, based on U, PA cannot prove the randomness of its halting probability. The paper also includes a sharper form of the Kraft-Chaitin Theorem, as well as a formal proof of this theorem written with the proof assistant Isabelle. (shrink)
Finite automata have been recently used as alternative, discrete models in theoretical physics, especially in problems related to the dichotomy between endophysical/intrinsic and exophysical/ extrinsic perception . These studies deal with Moore experiments; the main result states that it is impossible to determine the initial state of an automaton, and, consequently, a discrete model of Heisenberg uncertainty has been suggested. For this aim the classical theory of finite automata — which considers automata with initial states — is not adequate, and (...) a new approach is necessary. A study of finite deterministic automata without initial states is exactly the aim of this paper. We will define and investigate the complexity of various types of simulations between automata. Minimal automata will be constructed and proven to be unique up to an isomorphism. We will build our results on an extension of Myhill-Nerode technique; all constructions will make use of “automata responses” to simple experiments only, i.e., no information about the internal machinery will be considered available. (shrink)
Penrose [40] has discussed a new point of view concerning the nature of physics that might underline conscious thought processes. He has argued that it might be the case that some physical laws are not computable, i.e. they cannot be properly simulated by computer; such laws can most probably arise on the “no-man’s-land” between classical and quantum physics. Furthermore, conscious thinking is a non-algorithmic activity. He is opposing both strong AI , and Searle’s [47] contrary viewpoint mathematical “laws”).