Publication date
January 1999
DOI Publisher
Columbia University Libraries/Information Services Language
EnglishAbstract
Physicists should consider an alternative to the Turing‐machine model of computation
Physicists should consider an alternative to the Turing‐machine model of computation
In recent years, classical computability has expanded beyond its original scope to address issues re...
Computer science is based on classical, discreet models of computation such as the Turing machine or...
International audienceA model of hypercomputation can compute at least one function not computable b...
COMPUTATION A central dogma of com-puter science is that the Turing-machine model is the appropriate...
Continuous complexity theory gets its name from the model of mathematical computation on which it is...
AbstractWe propose certain non-Turing models of computation, but our intent is not to advocate model...
Should the impossibility results of theoretical computer science be of concern to physics
AbstractThe real-number model of computation is used in computational geometry, in the approach sugg...
Approaching limitations of digital computing technologies have spurred research in neuromorphic and ...
Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optic...
Abstract. We propose a formalization of analog algorithms, extending the framework of abstract state...
AbstractMany attempts to transcend the fundamental limitations to computability implied by the Halti...
Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optic...
In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizi...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
In recent years, classical computability has expanded beyond its original scope to address issues re...
Computer science is based on classical, discreet models of computation such as the Turing machine or...
International audienceA model of hypercomputation can compute at least one function not computable b...
COMPUTATION A central dogma of com-puter science is that the Turing-machine model is the appropriate...
Continuous complexity theory gets its name from the model of mathematical computation on which it is...
AbstractWe propose certain non-Turing models of computation, but our intent is not to advocate model...
Should the impossibility results of theoretical computer science be of concern to physics
AbstractThe real-number model of computation is used in computational geometry, in the approach sugg...
Approaching limitations of digital computing technologies have spurred research in neuromorphic and ...
Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optic...
Abstract. We propose a formalization of analog algorithms, extending the framework of abstract state...
AbstractMany attempts to transcend the fundamental limitations to computability implied by the Halti...
Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optic...
In the 1930s, Turing suggested his abstract model for a practical computer, hypothetically visualizi...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
In recent years, classical computability has expanded beyond its original scope to address issues re...
Computer science is based on classical, discreet models of computation such as the Turing machine or...
International audienceA model of hypercomputation can compute at least one function not computable b...
Add to ORKG