Sciweavers

429 search results - page 12 / 86
» Turing computations on ordinals
Sort
View
48
Voted
CIE
2006
Springer
15 years 3 months ago
Can General Relativistic Computers Break the Turing Barrier?
István Németi, Hajnal Andréka
CIE
2006
Springer
15 years 3 months ago
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
le conservative rational abstract geometrical computation is Turing-universal d abstract) J
Jérôme Durand-Lose
TCS
2011
14 years 6 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
ECAL
2007
Springer
15 years 5 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
65
Voted
MCU
2007
95views Hardware» more  MCU 2007»
15 years 1 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud