1686 search results - page 34 / 338 » Programs as polygraphs: computability and complexity |
88
Voted
SAC
2011
ACM
14 years 14 days ago
2011
ACM
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
AI
2002
Springer
14 years 9 months ago
2002
Springer
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...
DEXAW
2003
IEEE
15 years 3 months ago
2003
IEEE
As users, computers, data and processes become increasingly mobile and the diversity of interacting devices increases, pervasive computing tasks are difficult to predict and to u...
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...