Sciweavers

265 search results - page 11 / 53
» entcs 2007
Sort
View
ENTCS
2007
159views more  ENTCS 2007»
14 years 9 months ago
Almost Every Domain is Universal
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
Manfred Droste, Dietrich Kuske
ENTCS
2007
72views more  ENTCS 2007»
14 years 10 months ago
Equivalence of Two Formal Semantics for Functional Logic Programs
Francisco Javier López-Fraguas, Juan Rodr&i...
ENTCS
2007
94views more  ENTCS 2007»
14 years 10 months ago
Membrane Systems with Marked Membranes
Robert Brijder, Matteo Cavaliere, Agustin Riscos-N...
ENTCS
2007
88views more  ENTCS 2007»
14 years 10 months ago
A Linear-time Tissue P System Based Solution for the 3-coloring Problem
Daniel Díaz-Pernil, Miguel A. Gutiér...
ENTCS
2007
91views more  ENTCS 2007»
14 years 10 months ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán