How to simulate free will in a computational device

Authors:
Rusins Freivalds
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Raina bulvaris. 29, Riga, LV-1459, Latvia
Venue:
ACM Computing Surveys (CSUR)
Year:
1999

Citing 12
Cited 0

There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator

Information and Control
On the power of two-way random generators and the impossibility of deterministic poly-space simulations

Information and Control
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes

Information and Computation
Molecular computation of solutions to combinatorial problems

Science
On the power of DNA-computing

Information and Computation
Quantum Computability

SIAM Journal on Computing
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
On Randomized Versus Deterministic Computation

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Lower Space Bounds for Randomized Computation

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
The Complexity of Probabilistic versus Deterministic Finite Automata

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract