30 search results - page 2 / 6 » The ibT degrees of computably enumerable sets are not dense |
LOGCOM
2007
15 years 4 days ago
2007
This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. Our initial characterisation, in the spirit of Post [27], of the degrees of the immune...
108
click to vote
TCS
2011
14 years 7 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
90
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
86
Voted
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
107
Voted
MCU
2004
15 years 1 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...