551 search results - page 68 / 111 » Natural proofs |
COCO
1995
Springer
15 years 3 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
CCCG
2003
15 years 1 months ago
2003
We address a question posed by Sibley and Wagon. They proved that rhombic Penrose tilings in the plane can be 3colored, but a key lemma of their proof fails in the natural 3D gene...
DBPL
1993
Springer
15 years 3 months ago
1993
Springer
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
105
click to vote
AUTOMATICA
1999
14 years 11 months ago
1999
Architectures based on a non-blocking fabric, such as a crosspoint switch, are attractive for use in high-speed LAN switches, IP routers, and ATM switches. These fabrics, coupled ...