A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length

DOI10.17516/1997-1397-2021-14-1-69-73MaRDI QIDQ5859289zbMATH OpenOpenAlexFDO

Authors Vladimir Rybakov

Publication date 16 April 2021

Published in Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/jsfu892

zbMATH Keywords

computationstime of computationuniversal Church-Turing machines

Mathematics Subject Classification ID

General logic (03Bxx) Computability and recursion theory (03Dxx) Proof theory and constructive mathematics (03Fxx) Nonstandard models (03Hxx)

Recommendations

• scientific article; zbMATH DE number 4005621
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• On Formalisms for Turing Machines
• Infinite time Turing machines
• Infinite time Turing machines with only one tape

Cites work

• scientific article; zbMATH DE number 1805574 (Why is no real title available?)
• scientific article; zbMATH DE number 1964695 (Why is no real title available?)
• Small universal Turing machines
• Small Weakly Universal Turing Machines

This page was built for publication: A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length

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