Sciweavers

11063 search results - page 48 / 2213
» On the existence of universal models
Sort
View
DLT
2008
13 years 9 months ago
Universal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
Cristian S. Calude, André Nies, Ludwig Stai...
ENTCS
2010
96views more  ENTCS 2010»
13 years 5 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
IJSWIS
2008
108views more  IJSWIS 2008»
13 years 7 months ago
Identity of Resources and Entities on the Web
One of the main strengths of the web is that it allows any party of its global community to share information with any other party. This goal has been achieved by making use of a u...
Valentina Presutti, Aldo Gangemi
ENTCS
2007
158views more  ENTCS 2007»
13 years 7 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
STACS
2009
Springer
14 years 2 months ago
On Local Symmetries and Universality in Cellular Automata
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
Laurent Boyer, Guillaume Theyssier