429 search results - page 39 / 86 » Turing computations on ordinals |
JETAI
1998
14 years 11 months ago
1998
The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are exam...
CCA
2005
Springer
15 years 1 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
105
click to vote
NIPS
2004
15 years 1 months ago
2004
Computation without stable states is a computing paradigm different from Turing's and has been demonstrated for various types of simulated neural networks. This publication t...
SOFSEM
2001
Springer
15 years 4 months ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...