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
Journal ArticleDOI
Comparing quasi-finitely axiomatizable and prime groups
TL;DR: In particular, all Baumslag-Solitar groups of the form ha; d j d"1ad 1⁄4 ai are quasi-finitely axiomatizable as discussed by the authors.
Proceedings Article
Quantum Algorithms, Paraconsistent Computation and Deutsch's Problem.
Juan C. Agudelo,Walter Carnielli +1 more
TL;DR: The new model of paraconsistent Turing machines is presented and the models of quantum Turing machines and quantum circuits are revised, stressing the concepts of entangled states and quantum parallelism which are important features for efficient quantum algorithms.
Journal ArticleDOI
Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels
TL;DR: It is argued in some detail that, in spite of a certain inherent inexactness of the analogy, every intuitively constructive truth is valid in Lauchli semantics, and therefore the Heyting Calculus is powerful enough to prove all constructive truths.
Book ChapterDOI
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
TL;DR: A review of a few recent results which look at nonlinear dynamical systems from a computational perspective, especially information concerning their long-term evolution.
Posted Content
An Analog Characterization of the Subrecursive Functions
TL;DR: It is claimed that there is a close connection between analog complexity classes, and the dynamical systems that compute them, and classical sets of subrecursive functions.