Sciweavers

2783 search results - page 280 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ARCS
2005
Springer
15 years 7 months ago
The Bio-Chemical Information Processing Metaphor as a Programming Paradigm for Organic Computing
All known life forms process information on a molecular level. This kind of chemical information processing is known to be robust, self-organizing, adaptive, decentralized, asynch...
Peter Dittrich
BIRTHDAY
2005
Springer
15 years 7 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
CALCO
2005
Springer
69views Mathematics» more  CALCO 2005»
15 years 7 months ago
From T-Coalgebras to Filter Structures and Transition Systems
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...
H. Peter Gumm
CIE
2005
Springer
15 years 7 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
15 years 7 months ago
On the Sensitivity of Cyclically-Invariant Boolean Functions
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
Sourav Chakraborty