It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
In this research we investigate an approach for adaptive dynamic instruction set extension, tuning processors to specific applications after fabrication. Categories and Subject De...