11 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.AR2007★ 11 cited
A Light-Based Device for Solving the Hamiltonian Path Problem
Mihai Oltean
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on…
nlin.CD2001
Computing A Glimpse of Randomness
Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu
A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computab…