ALIFE
2000
13 years 4 months ago
2000
This article lists fourteen open problems in artificial life, each of which is a grand challenge requiring a major advance on a fundamental issue for its solution. Each problem is ...
SYNTHESE
2008
13 years 4 months ago
2008
We present a number of, somewhat unusual, ways of describing what Craig's interpolation theorem achieves, and use them to identify some open problems and further directions. K...
ECCC
2008
13 years 4 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
IEEEARES
2008
IEEE
13 years 11 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
We introduce a learning framework that combines elements of the well-known PAC and mistake-bound models. The KWIK (knows what it knows) framework was designed particularly for its...