154 search results - page 4 / 31 » Cobham recursive set functions |
DLT
2008
13 years 7 months ago
2008
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...
LICS
2007
IEEE
14 years 8 days ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
JMLR
2006
13 years 6 months ago
2006
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
FOSSACS
2010
Springer
14 years 25 days ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
ALT
2001
Springer
14 years 3 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...