Voltar
Capítulo de livro Acesso aberto Revisado por pares
BIBTEX RIS

A Basis for a Mathematical Theory of Computation)

1963; Elsevier BV; Linguagem: Inglês

10.1016/s0049-237x(08)72018-4

ISSN

2542-6702

Autores

John McCarthy,

Tópico(s)

Computability, Logic, AI Algorithms

Resumo

This chapter discusses the basis for a mathematical theory of computation. It describes several descriptive formalisms with a few examples of their use, and illustrates the theory that enables to prove the equivalence of computations expressed in these formalisms. Some of the formalisms treated are computable functional, non-computable functions, and ambiguous functions. The chapter presents a few mathematical results about the properties of the formalisms introduced. A number of new formalisms for expressing computable functions and related entities are described. The relation between formalism and computer programming languages is discussed.

Referência(s)