244 search results - page 13 / 49 » Turing machines and bimachines |
EUROGP
1999
Springer
13 years 11 months ago
1999
Springer
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...
AB
2008
Springer
14 years 1 months ago
2008
Springer
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
CIE
2005
Springer
14 years 28 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
COLING
1994
13 years 8 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
AGI
2011
12 years 11 months ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...