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...
Bahareh Afshari, George Barmpalias, S. Barry Coope...
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...
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...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
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...
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...