Theory of Recursive Functions and Effective Computability.
Solomon Feferman,Hartley Rogers +1 more
TLDR
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.About:
This article is published in American Mathematical Monthly.The article was published on 1969-06-01 and is currently open access. It has received 3665 citations till now. The article focuses on the topics: μ operator & μ-recursive function.read more
Citations
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI
Molecular computation of solutions to combinatorial problems
TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
Journal ArticleDOI
A logic for default reasoning
TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.
Journal ArticleDOI
Recursively enumerable sets and degrees
TL;DR: In this paper, the relation of the structure of an R set to its degree is discussed, and the infinite injury priority method is proposed to solve the problem of scaling and splitting R sets.