562 search results - page 16 / 113 » Concurrent Turing Machines |
135
Voted
EXTREME
2004
ACM
15 years 9 months ago
2004
ACM
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
148
Voted
JAC
2008
15 years 5 months ago
2008
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
101
Voted
CATS
2007
15 years 5 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...
172
click to vote
LOGCOM
2010
14 years 10 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
115
Voted
HRI
2010
ACM
15 years 9 months ago
2010
ACM
—Alan Turing proposed a test for the intelligence of machines in 1950 [1]. Despite great efforts, no computer has passed this test so far. Each year, chat bots compete for the Lo...