Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Minds and Machines
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Zeno machines and hypercomputation
Theoretical Computer Science
Dynamical Bias in the Coin Toss
SIAM Review
Quantum Computer Science: An Introduction
Quantum Computer Science: An Introduction
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of "steps" involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accelerated (hyper-) computers and the recursion theoretic diagonal methods are discussed. As quantum information is not bound by the mutually exclusive states of classical bits, it allows a consistent representation of fixed point states of the diagonal operator. In an effort to reconstruct the self-contradictory feature of diagonalization, a generalized diagonal method allowing no quantum fixed points is proposed.