1717 search results - page 174 / 344 » A Computable Spectral Theorem |
176
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
181
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
135
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
191
click to vote
GG
2004
Springer
15 years 12 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
168
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We develop a logic for reasoning about object-oriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for self-reference in...