180 search results - page 26 / 36 » Self-Assembly of Infinite Structures |
AICT
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, nonlinear digital filters with finite precision are analyzed as recursive systematic convolutional (RSC) encoders. An infinite impulse response (IIR) digital filt...
APAL
2010
13 years 9 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
ICGI
2010
Springer
13 years 7 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
ESOP
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
JCSS
2008
13 years 9 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...