|
Institute for
|
|
|
Julian Martin Fernandez
Turing Machines
|
I studied the problem of the limits of
computability. I proposed an ideal machine whose computational power was
beyond the Turing limit. There are other paradigms that have more computing
power than a Turing machine, like computation over the real numbers. However
these ideal devices are not universal (i.e., they are not programmable). The
novelty and importance of the machine that I proposed consists in
demonstrating that in principle there exists a machine that is both,
universal and has a computational power beyond the Turing limit. For more
details see Fernandez
(2000). |