Titlebook: Mathematical Foundations of Computer Science 1996; 21st International S Wojciech Penczek,Andrzej Szałas Conference proceedings 1996 Springe

padding

Code problems on traces,iew of the current state of some basic questions in this field. Among these, we consider the existence problem for strong codings, clique-preserving morphisms and the unique decipherability problem (code problem).

unstable-angina

Models of DNA computation,elivered his famous paper describing sub-microscopic computers. Recently, several papers have advocated the realisation of massively parallel computation using the techniques and chemistry of molecular biology. Algorithms are not executed on a traditional, siliconbased computer, but instead employ t

外面

抚育

宽大

collagen

Mind the gap! Abstract versus concrete models of specifications, modelled as ordinary functions. The theory that underlies the formal development of programs from specifications takes advantage of the many useful properties that these models enjoy..The models that underlie the semantics of programming languages are different. For example, the semantics of Standa

谄媚于人

enterprise

Dislocation

愚笨

On the query complexity of sets,ested in the complexity of certain . in this context. We study the sets ODD.={(x.,..., ..)∶¦. ∩ {..,..., ..}¦ is odd} and WMOD(.).={(..,..., ..)∶¦. ∩ {..,..., ..}¦≢0 (mod .)}..If . or . is semirecursive, we obtain tight bounds on the query complexity of ODD. and WMOD(.).. We obtain lower bounds for