Turing machines with a schedule to keep

DOI10.1016/S0019-9958(67)90433-0zbMath0153.31701OpenAlexW2035206170MaRDI QIDQ5534213

Patrick C. Fischer

Publication date: 1967

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(67)90433-0

zbMATH Keywords

mathematical logic

Related Items (5)

On restricted turing computability ⋮ Complexity of algorithms and computations ⋮ On the sequential nature of functions ⋮ Multitape one-way nonwriting automata ⋮ Time-restricted sequence generation

This page was built for publication: Turing machines with a schedule to keep