4401 search results - page 115 / 881 » Computing with Default Logic |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
CIE
2010
Springer
14 years 1 months ago
2010
Springer
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
ACMSE
2000
ACM
14 years 1 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
ENTCS
2011
13 years 3 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
ISCA
2010
IEEE
14 years 2 months ago
2010
IEEE
As CMOS scales beyond the 45nm technology node, leakage concerns are starting to limit microprocessor performance growth. To keep dynamic power constant across process generations...