Open AccessBook
Classical recursion theory
Reads0
Chats0
TLDR
Theories of Recursive functions, Hierarchies of recursive functions, and Arithmetical sets: Recursively enumerable sets.Abstract:
Preface. Introduction. Theories of Recursive functions. Hierarchies of recursive functions. Recursively enumerable sets. Recursively enumerable degrees. Limit sets. Arithmetical sets. Arithmetical degrees. Enumeration degrees. Bibliography. Notation index. Subject index.read more
Citations
More filters
Posted Content
Isomorphism types of Rogers semilattices in the analytical hierarchy.
TL;DR: In this article, it was shown that any non-trivial Rogers semilattice of a non-zero natural numbers of a countable family cannot be isomorphic to a Rogers semiilattices of a π^1_m$-computable family.
NONBOUNDING n-C.E. Q-DEGREES
TL;DR: It is proved that for any noncomputable c.e. set A there is a non- computable c.
Journal ArticleDOI
Dominance dimension: a common parametric formulation for integer-valued scientific impact indices
TL;DR: It is shown that by a suitable choice of parameters dominance dimension may specialize to the most widely known and used of those impact scores for the scientific output of authors which disallow endogenous reputation effects, including the Durfee- or h-number, the publication number and the citation number.
Book ChapterDOI
On the completeness of quantum computation models
Pablo Arrighi,Gilles Dowek +1 more
TL;DR: The notion of computability is stable over infinite-dimensional vector spaces provided they have a finite "tensorial dimension" and permit to define an absolute notion of completeness for quantum computation models and give a precise meaning to the Church-Turing thesis.
Journal ArticleDOI
On function languages and parallel computers
Amos R Omondi,Amos R Omondi +1 more
TL;DR: To widen their scope of applicability, functional languages need to include more features of nondeterminism and may need to be integrated with features from conventional languages, and the right sort of architectures for such extended languages may be less-specialised ones with a von Neumann flavour.