Recursive Unsolvability of Post's Problem of "Tag" and Other Topics in Theory of Turing Machines

Annals of Mathematics - United States
doi 10.2307/1970290
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

A Note on the Recursive Unsolvability of Primitive Recursive Arithmetic

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1966English

Ultrametric Automata and Turing Machines

English

Implementation of DNA Pattern Recognition in Turing Machines

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

Other Minds, Other Intelligences: The Problem of Attributing Agency to Machines

Cambridge Quarterly of Healthcare Ethics
Legal AspectsEthicsHealthIssuesHealth Policy
2019English

Four Small Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

A Comparison of the Work Done by Generalized Sequential Machines and Turing Machines

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1962English

Universality of Quantum Turing Machines With Deterministic Control

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2015English

Logical Depth for Reversible Turing Machines With an Application to the Rate of Decrease in Logical Depth for General Turing Machines

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Dream of Simplicity: Scientific Computing on Turing Machines

Computing in Science and Engineering
EngineeringComputer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy