Hostname: page-component-7c8c6479df-5xszh Total loading time: 0 Render date: 2024-03-28T10:08:04.142Z Has data issue: false hasContentIssue false

An Informal Arithmetical Approach to Computability and Computation

Published online by Cambridge University Press:  20 November 2018

Z.A. Melzak*
Affiliation:
University of British Columbia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In 1936 A. M. Turing published his analysis of the notion of effective computability. Very roughly speaking, its object was to distinguish between numbers defined by existential statements and those defined by purely constructive ones. Guided by his schematizing of what goes on when a person calculates using paper and pencil, Turing introduced the concept of an A-machine, eventually to be called a Turing machine. Such a machine consists of a box and a linear tape divided into squares, indefinitely long in both directions. The tape passes through the box and exactly one square of it is always within the box. The system changes only at certain discrete times: t = 0, 1, …. Each square can carry exactly one of the finite set of symbols: s1, s2, …, sn, one of which may be the blank.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1961