429 search results - page 24 / 86 » Turing computations on ordinals |
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
CSFW
2006
IEEE
15 years 3 months ago
2006
IEEE
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
ITICSE
2005
ACM
15 years 3 months ago
2005
ACM
One of the largest barriers to learning programming is the precise and complex syntax required to write programs. This barrier is a key impediment to the integration of programmin...
75
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the n...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
This short paper is intended to describe for the layman why Jim Gray won so many awards, culminating in his being selected to receive the 1998 ACM Turing Award, arguably the "...