activity
19992006
most citedComputing a Turing-Incomputable Problem from Quantum Computing

2 citations · 6 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2006★ 2 cited

Quantum hypercomputation based on the dynamical algebra su(1,1)

Andrés Sicard, Juan Ospina, Mario Vélez

An adaptation of Kieu's hypercomputational quantum algorithm (KHQA) is presented. The method that was used was to replace the Weyl-Heisenberg algebra by other dynamical algebra of…

quant-ph2005

Numerical Simulations of a Possible Hypercomputational Quantum Algorithm

Andrés Sicard, Juan Ospina, Mario Vélez

The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simul…

quant-ph2004★ 2 cited

A possible hypercomputational quantum algorithm

Andrés Sicard, Mario Vélez, Juan Ospina

The term `hypermachine' denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We p…

quant-ph2003★ 2 cited

Computing a Turing-Incomputable Problem from Quantum Computing

Andrés Sicard, Mario Vélez, Juan Ospina

A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu q…

quant-ph1999

Some relations between quantum Turing machines and Turing machines

Andrés Sicard, Mario Vélez

For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components…