Turing machines. Introduction to the characterization of the complexity of a problem

MaRDI QIDQ5851435zbMATH OpenFDO

Authors Éric Jacopin

Publication date 22 January 2010

zbMATH Keywords

computational complexityMathematicaTuring machine

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Observability of Turing machines: a refinement of the theory of computation
• Turing machine and its symbolic simulation
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• scientific article; zbMATH DE number 527373 (Why is no real title available?)
• scientific article; zbMATH DE number 1157791 (Why is no real title available?)
• Turing machines as clocks, rulers and randomizers
• scientific article; zbMATH DE number 2096708 (Why is no real title available?)
• scientific article; zbMATH DE number 6302782 (Why is no real title available?)

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Turing machines. Introduction to the characterization of the complexity of a problem

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