On Computable Numbers

In 1936, in his famous paper ‘On Computable Numbers,’ Alan Turing announced, ‘It is possible to invent a single machine which can be used to compute any computable sequence,’ and then showed how – at least in principle – to build such a machine.

‘Any indefinite function,’ ‘any computable sequence,’ – that simple word any holds here a vastness perhaps equal to the universe, or your consciousness.

-Vikram Chandra, Geek Sublime: The Beauty of Code, the Code of Beauty

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s