## Coins, Quantum Measurements, and Turing's Barrier (2002)

by
C. S. Calude
,
B. Pavlov
,
Cristian S. Calude
,
Boris Pavlov

### BibTeX

@MISC{Calude02coins,quantum,

author = {C. S. Calude and B. Pavlov and Cristian S. Calude and Boris Pavlov},

title = {Coins, Quantum Measurements, and Turing's Barrier},

year = {2002}

}

### OpenURL

### Abstract

Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is negative. This paper re-opens the case: we will discuss solutions to a few simple problems which suggest that quantum computing is theoretically capable of computing uncomputable functions.