scispace - formally typeset
Open AccessBook

Theory of Recursive Functions and Effective Computability

TLDR
In this paper, the authors discuss related theories of recursively enumerable sets, degree of un-solvability and turing degrees in particular, and generalizations of recursion theory.
Abstract
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular. A second group of topics has to do with generalizations of recursion theory. The third topics group mentioned is subrecursive computability and subrecursive hierarchies

read more

Citations
More filters
Book

Davenport-Schinzel sequences and their geometric applications

TL;DR: A close to linear bound on the maximum length of Davenport--Schinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.
Journal ArticleDOI

The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

TL;DR: In this paper, a microscopic quantum mechanical model of computers as represented by Turing machines is constructed, and the model parameters can be adjusted so that for an arbitrary time interval, the “machine” part of the model is stationary.
Journal ArticleDOI

Model-Checking in Dense Real-Time

TL;DR: An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
Journal ArticleDOI

Agent-based computational models and generative social science

TL;DR: It is argued that the agent-based computational model permits a distinctive approach to social science for which the term “generative” is suitable, and the connection between agent- based modeling and classical emergentism is taken up, criticizing the latter and arguing that the two are incompatible.