Persistent Computations of Turing Machines

DOI10.1007/978-3-540-70844-5_18MaRDI QIDQ3602812zbMATH OpenOpenAlexFDO

Authors Harald Hempel, Madlen Kimmritz

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_18

Mathematics Subject Classification ID

Cites work

• ASPECTS OF PERSISTENT COMPUTATIONS
• General Recursive Functions
• scientific article; zbMATH DE number 54171 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• New heuristic and interactive approaches to 2D rectangular strip packing

Cited in

(5)

• Computing with continuous change
• Question answering by humans and machines: a complexity-theoretic view
• ASPECTS OF PERSISTENT COMPUTATIONS
• scientific article; zbMATH DE number 1897131 (Why is no real title available?)
• scientific article; zbMATH DE number 7167584 (Why is no real title available?)

This page was built for publication: Persistent Computations of Turing Machines

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