25 search results - page 5 / 5 » The Complexity of Small Universal Turing Machines |
AC
1998
Springer
13 years 5 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
TRS
2008
13 years 5 months ago
2008
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
SEMCO
2008
IEEE
13 years 11 months ago
2008
IEEE
Gesture interfaces are needed for natural intuitive communication with machine devices. Hand gesture intuitiveness is the cognitive association between a command or intent, and it...
SPIN
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...