On Computable Numbers

Title: On Computable Numbers, with an application to the Entscheidungsproblem (https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf)

Author: Alan M. Turing

Published: Journal of Math, Volume 58, 345-363 (1936)

Abstract:

The "computable" numbers may be described briefly as the real numbers whose
expressions as a decimal are calculable by finite means. Although the subject of this paper is ostensibly the computable numbers, it is almost equally easy to define and investigate computable functions of an integral variable or a real or computable variable, computable predicates, and so forth. This will include a development of the theory of functions of a real variable expressed in terms of computable numbers. According to my definition, a number is computable if its decimal can be written down by a machine.

Presenter Bio:

Kyle Geske (https://twitter.com/stungeye) is a computer engineer, web coder, and artist. He is a co-founder of Open Democracy Manitoba (http://opendemocracymanitoba.ca/), their current chair, and their lead programmer. Separately, as a programming instructor at Red River College (http://rrc.ca), Kyle challenges and inspires the next generation of Manitoban web and app innovators.