• Publications
  • Influence
Randomness and undecidability in physics
  • K. Svozil
  • Mathematics, Computer Science
  • 5 October 1993
Part 1 Algorithmic physics: algorithmics automata coding and representation automator worlds algorithmic information and other resources measures and Randomness: conceptual developments. Expand
Quantum Logic
  • K. Svozil
  • Computer Science
  • Discrete mathematics and theoretical computer…
  • 1998
When reading the PDF, the author is very reliable in using the words to create sentences, and the ways how the author creates the diction to influence many people will be seen. Expand
Strong Kochen-Specker theorem and incomputability of quantum randomness
The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistentExpand
Experimental Evidence of Quantum Randomness Incomputability
This work provides experimental evidence of incomputability--an asymptotic property--of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory. Expand
Optimal tests of quantum nonlocality
We present a general method for obtaining all Bell inequalities for a given experimental setup. Although the algorithm runs slowly, we apply it to two cases. First, the Greenberger-Horne-ZeilingerExpand
Quantum Logic in Algebraic Approach
Yet much is still to be done to establish quantum logic as an indispensable tool, an area of research which not only o!ers new insights into established quantum physics but which progressivelyExpand
Quantum field theory on fractal spacetime: a new regularisation method
Spacetime is modelled as a fractal subset of Rn. Analysis on homogeneous sets with non-integer Hausdorff dimensions is applied to the low-order perturbative renormalisation of quantumExpand
The Church-Turing thesis as a guiding principle for physics
Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument against motion, dealing with Zeno squeezed time cycles of computers.Expand
Quantum algorithmic information theory
  • K. Svozil
  • Mathematics, Computer Science
  • 5 October 1995
The agenda of quantum algorithmic information theory, ordered ‘top-down,’ is the quantum halting amplitude, followed by the quantumgorithmic information content, which in turn requires the theory of quantum computation, based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capable of arbitrary U(2) transformations. Expand
Computational universes
Suspicions that the world might be some sort of a machine or algorithm existing ‘‘in the mind’’ of some symbolic number cruncher have lingered from antiquity. Although popular at times, the mostExpand