computable

Sokal affair

Turing machine

nationality

British

occupation / innovator as

mathematician

logician

innovator in the field of

computer science

cryptanalysis

mathematics

university teacher

sexual orientation

homosexual

computer scientist

artificial intelligence researcher

cryptographer

statistician

cryptography

religion

atheism

cause of death

suicide

logic

scientific organization

Royal Society

marathon runner

is the idea that a task is computable if one can specify a sequence of instructions when followed will result in the completion of the task.

Intuitively a task is computable if one can specify a sequence of instructions which when followed will result in the completion of the task. Such a set of instructions is called an effective procedure, or algorithm, for the task. (stanford)

is on our radar. Try again later or consider contributing!

is a simple abstract computational device intended to help investigate the limitations of what can be computed.

Turing machines, first described by Alan Turing in (Turing 1937), are simple abstract computational devices intended to help investigate the extent and limitations of what can be computed.(stanford)

is interested in the problem of what it means to be computable.

Turing, writing before the invention of the modern digital computer, was interested in the question of what it means to be computable. (stanford)

Alan TuringThinkers

Alan Turing