Results 1 
2 of
2
Hypercomputability of quantum adiabatic processes: facts versus prejudices
 http://arxiv.org/quantph/0504101
, 2005
"... Abstract. We give an overview of a quantum adiabatic algorithm for Hilbert’s tenth problem, including some discussions on its fundamental aspects and the emphasis on the probabilistic correctness of its findings. For the purpose of illustration, the numerical simulation results of some simple Diopha ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract. We give an overview of a quantum adiabatic algorithm for Hilbert’s tenth problem, including some discussions on its fundamental aspects and the emphasis on the probabilistic correctness of its findings. For the purpose of illustration, the numerical simulation results of some simple Diophantine equations are presented. We also discuss some prejudicial misunderstandings as well as some plausible difficulties faced by the algorithm in its physical implementations. “To believe otherwise is merely to cling to a prejudice which only gives rise to further prejudices... ” 1
Foundations of Real Analysis and Computability Theory in NonAristotelian Finitary Logic
, 2005
"... This paper outlines new paradigms for real analysis and computability theory in the recently proposed nonAristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts from Euclidean geometry into an extension (NPAR) of the NAF ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper outlines new paradigms for real analysis and computability theory in the recently proposed nonAristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts from Euclidean geometry into an extension (NPAR) of the NAFL version of Peano Arithmetic (NPA). Such a translation is possible because NPA proves the existence of every infinite proper class of natural numbers that is definable in the language of NPA. Infinite sets are not permitted in NPAR and quantification over proper classes is banned; hence Cantor’s diagonal argument cannot be legally formulated in NRA, and there is no ‘cardinality ’ for any collection (‘superclass’) of real numbers. Many of the useful aspects of classical real analysis, such as, the calculus of Newton and Leibniz, are justifiable in NRA. But the paradoxes, such as, Zeno’s paradoxes of motion and the BanachTarski paradox, are resolved because NRA admits only closed