The problem of constructing a universal machine is not insoluble.

Computer science, codebreaking

Share:

Details

Context

On Computable Numbers, with an Application to the Entscheidungsproblem

Date / Period

1936

Source

https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf

Verification

Unverifiable

Explanation

Found in 1 providers: grok

Method

Cross Reference

Sources Checked

1 source