14 found
Order:
See also
Cristian S. Calude
University of Auckland
  1. The Deluge of Spurious Correlations in Big Data.Cristian S. Calude & Giuseppe Longo - 2017 - Foundations of Science 22 (3):595-612.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  7
    On Partial Randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  3. On a Theorem of Günter Asser.Cristian S. Calude & Lila Sântean - 1990 - Mathematical Logic Quarterly 36 (2):143-147.
  4.  6
    Spurious, Emergent Laws in Number Worlds.Cristian S. Calude & Karl Svozil - 2019 - Philosophies 4 (2):17-0.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. WHAT IS. . . A Halting Probability?Cristian S. Calude - unknown
    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 (...)
    Translate
     
     
    Export citation  
     
    Bookmark  
  6.  49
    Embedding Quantum Universes in Classical Ones.Cristian S. Calude, Peter H. Hertling & Karl Svozil - 1999 - Foundations of Physics 29 (3):349-379.
    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, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  4
    Computing with Cells and Atoms in a Nutshell.Cristian S. Calude & Gheorghe P.?un - 2000 - Complexity 6 (1):38-48.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  10
    Reflections on Quantum Computing.Michael J. Dinneen, Karl Svozil & Cristian S. Calude - 2000 - Complexity 6 (1):35-37.
  9.  66
    Incompleteness, Complexity, Randomness and Beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
    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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  10.  3
    Computing with Cells and Atoms in a Nutshell.Cristian S. Calude & Gheorghe Păun - 2000 - Complexity 6 (1):38-48.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  21
    Are Binary Codings Universal?Cristian S. Calude & Cezar Câmpeanu - 1996 - Complexity 1 (5):47-50.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  12.  6
    A Genius's Story: Two Books on Gödel.Cristian S. Calude - 1997 - Complexity 3 (2):11-15.
  13.  5
    Generalisation of Disjunctive Sequences.Cristian S. Calude - 2005 - Mathematical Logic Quarterly 51 (2):120.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  14. Real Numbers: From Computable to Random.Cristian S. Calude - 2001 - Studia Philosophica 1.
    A real is computable if it is the limit of a computable, increasing, computably converging sequence of rational...
     
    Export citation  
     
    Bookmark