# Karl Svozil

According to our database

Collaborative distances:

^{1}, Karl Svozil authored at least 37 papers between 1993 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Quantum Probability and Randomness.

Entropy, 2019

2018

New Forms of Quantum Value Indefiniteness Suggest That Incompatible Views on Contexts Are Epistemic.

Entropy, 2018

Dimensional Lifting through the Generalized Gram-Schmidt Process.

Entropy, 2018

2017

Quantum music.

Soft Comput., 2017

Why Computation?

IJUC, 2017

2016

Orthogonal Vector Computations.

Entropy, 2016

2015

A Non-Probabilistic Model of Relativised Predictability in Physics.

Information, 2015

On the Unpredictability of Individual Quantum Measurement Outcomes.

Proceedings of the Fields of Logic and Computation II, 2015

2014

Non-contextual chocolate balls versus value indefinite quantum cryptography.

Theor. Comput. Sci., 2014

A quantum random number generator certified by value indefiniteness.

Mathematical Structures in Computer Science, 2014

Physical Aspects of Oracles for Randomness and Hadamard's Conjecture.

Proceedings of the Computing with New Resources, 2014

2012

How much contextuality?

Natural Computing, 2012

Preface.

Natural Computing, 2012

Can a Computer be "Pushed" to Perform Faster-Than-Light?

IJUC, 2012

Haunted Quantum Contextuality versus Value Indefiniteness.

Proceedings of the Computation, Physics and Beyond, 2012

2011

Quantum value indefiniteness.

Natural Computing, 2011

Harvesting the Quantum Quagmire.

IJUC, 2011

2010

The diagonalization method in quantum recursion theory.

Quantum Information Processing, 2010

Zeno Squeezing of Cellular Automata.

IJUC, 2010

2009

On the solution of trivalent decision problems by quantum state identification.

Natural Computing, 2009

Quantum scholasticism: On quantum contexts, counterfactuals, and the absurdities of quantum omniscience.

Inf. Sci., 2009

On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory.

Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008

How to Acknowledge Hypercomputation?

Complex Systems, 2008

2002

Finite Automata Models of Quantized Systems: Conceptual Status and Outlook.

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

Computational complementarity for probabilistic automata.

Proceedings of the Where Mathematics, 2001

2000

Reflections on quantum computing.

Complexity, 2000

Quantum Information: The New Frontier.

Proceedings of the Unconventional Models of Computation, 2000

Quantum Correlations Conundrum: An Automata-Theoretic Approach.

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

A Packing Problem, Solved by Genetic Algorithms.

J. UCS, 1999

1998

The limits of mathematics by Gregory J. Chaitin.

Complexity, 1998

One-to-one.

Complexity, 1998

Quantum Logic.

Discrete mathematics and theoretical computer science, Springer, ISBN: 978-981-4021-07-4, 1998

1996

The Axiom of Choice in Quantum Theory.

Math. Log. Q., 1996

Quantum Information Theory.

J. UCS, 1996

How real are virtual realities, how virtual is reality? - Constructive re-interpretation of physical undecidability.

Complexity, 1996

1995

Halting Probability Amplitude Quantum Computers.

J. UCS, 1995

1993

Randomness and undecidability in physics.

World Scientific, ISBN: 978-981-02-0809-7, 1993