429 search results - page 22 / 86 » Turing computations on ordinals |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
CORR
2008
Springer
14 years 11 months ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
88
Voted
ECCC
2000
14 years 9 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
129
click to vote
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...