385 citations · 429 across the 11 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
quant-ph2004★ 2 cited
An anatomy of a quantum adiabatic algorithm that transcends the Turing computability
Tien D. Kieu
We give an update on a quantum adiabatic algorithm for the Turing noncomputable Hilbert's tenth problem, and briefly go over some relevant issues and misleading objections to the a…
quant-ph2004★ 2 cited
Finiteness of the universe and computation beyond Turing computability
Tien D. Kieu
We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, th…
cs.OH2004★ 2 cited
Using biased coins as oracles
Toby Ord, Tien D. Kieu
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a b…