244 search results - page 24 / 49 » Turing machines and bimachines |
CATS
2007
15 years 1 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
DIGRA
2005
Springer
15 years 5 months ago
2005
Springer
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
ADC
2004
Springer
15 years 5 months ago
2004
Springer
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
OTM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We introduce XMLVM, a Turing complete XML-based programming language based on a stack-based, virtual machine. We show how XMLVM can automatically be created from Java cla...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...