2.2 Machine models Throughout this thesis we will be considering computing devices as
acceptors of sets of sequences, or languages. Al ternatively we may view these as 0-1 …

The maturity of a field of research is probably best characterized by the existence of
handbooks that explain its problems, results, applications, and methodology; allow their …

We examine the following question:'Given a problem, is it more difficult to tell how many
solutions the problem has than just deciding whether it has a solution?'. We show, that in …

The purpose of this paper is to prove the following result: Theorem 1 For any real numbers
r1, r2, 1≤ r1< r2, there is a set A of strings which has nondeterministic time complexity nr2 …

I. Introduction. In his celebrated paper [1], AM Turing investigated the computability of
sequences (functions) by mechanical procedures and showed that the set of sequences can …

Publisher Summary This chapter discusses the complexity of finite functions. A deterministic
Turing machine consists of a finite control and a finite collection of tapes each with a head …

The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine
on a deterministic Turing machine is investigated. Results include the following: Theorem. A …

A set of sufficient conditions on tape functions Ll (n) and L2 (n) is presented that guarantees
the existence of a set accepted by an Ll (n)-tape bounded nondeterministic Turing machine …

Turing, writing before the invention of the modern digital computer, was interested in the
question of what it means to be computable. Intuitively a task is computable if one can …

A terminated Turing machine computation can be represented by a two-dimensional
diagram showing successive tape configurations. The machine to be described, when given …