Elementar computability theory

MaRDI QIDQ1911231zbMATH OpenFDO

Authors Einar Smith

Publication date 17 April 1996

Published in Springer-Lehrbuch (Search for Journal in Brave)

zbMATH Keywords

computability theoryTuring machineswhile-programs

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 225477
• A mathematical primer on computability
• scientific article; zbMATH DE number 530148

Cited in

(9)

• scientific article; zbMATH DE number 3992928 (Why is no real title available?)
• Introduction to computability
• EAGLE start-up aid. Theory of computability. Cantor diagonalization, Gödelization, Turing machines
• A mathematical primer on computability
• Computability
• scientific article; zbMATH DE number 5778850 (Why is no real title available?)
• Computability. Logic, reasoning, computer and Assembler, infinity, limits of automatizability. Textbook for class-room and self-study
• scientific article; zbMATH DE number 530148 (Why is no real title available?)
• The intensional content of Rice's theorem

This page was built for publication: Elementar computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911231)