Algorithmics: theory & practice
Algorithmics: theory & practice
Computability and logic
Complexity
Parallel computation: models and methods
Parallel computation: models and methods
Complexity - Special issue on uncoventional models of computation
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
A new kind of science
The Universal Computer: The Road from Leibniz to Turing
The Universal Computer: The Road from Leibniz to Turing
Elementary Computability, Formal Languages and Automata
Elementary Computability, Formal Languages and Automata
Minds and Machines
Minds and Machines
Minds and Machines
Minds and Machines
Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
Computation beyond turing machines
Communications of the ACM - Digital rights management
Superlinear Performance in Real-Time Parallel Computation
The Journal of Supercomputing
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Hypercomputation: philosophical issues
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
From Utopian to Genuine Unconventional Computers
From Utopian to Genuine Unconventional Computers
Do Accelerating Turing Machines Compute the Uncomputable?
Minds and Machines
Supertasks do not increase computational power
Natural Computing: an international journal
| Hi-index | 0.00 |
This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at a number of computations that could be performed with an accelerating machine, and review various possible implementation methods that have been proposed. Finally, we expose the limitations of accelerating machines and conclude by posing some problems for further research.