On Computable Numbers, with an Application to the Entscheidungsproblem
the universal machine and the undecidability of the halting problem
Read it
EnglishTiếng Việt (abstract only)中文 (abstract only)日本語 (abstract only)
English beside Tiếng ViệtEnglish beside 中文English beside 日本語
- 4 sections
- 0 figures
- 0 equations
- 0 references
- cited by 0 here
- difficulty 5 of 5
- the publisher's page
Contents
Its place here
Nobody has read this paper's bibliography yet, so it cites nothing here.