Sciweavers

17298 search results - page 8 / 3460
» Abstract computing machines
Sort
View
CIE
2009
Springer
14 years 2 months ago
Ordinal Computability
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
Peter Koepke
ASM
2005
ASM
14 years 1 months ago
Scenario based Analysis of Linear Computations
Abstract. In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of...
Vladimir Filatov, Rostislav Yavorskiy
BSL
2008
98views more  BSL 2008»
13 years 7 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 4 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro
BIOADIT
2006
Springer
13 years 11 months ago
Bio-inspired Computing Machines with Self-repair Mechanisms
Abstract. Developmental biology requires three principles of organization characteristic of living organisms: multicellular architecture, cellular division, and cellular differenti...
André Stauffer, Daniel Mange, Gianluca Temp...