315 search results - page 17 / 63 » Reactive Turing Machines |
115
Voted
ENTCS
2011
14 years 9 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
311
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.
131
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
In formal language theory, many families of languages are deļ¬ned using grammars or ļ¬nite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
121
Voted
ANNALS
2010
14 years 11 months ago
2010
The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...
105
click to vote
ICML
1990
IEEE
15 years 6 months ago
1990
IEEE
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...