Persistent Computations of Turing Machines

DOI10.1007/978-3-540-70844-5_18zbMATH Open1172.68472OpenAlexW37746593MaRDI QIDQ3602812FDOQ3602812

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

• Title not available (Why is that?)
• New heuristic and interactive approaches to 2D rectangular strip packing
• General Recursive Functions
• ASPECTS OF PERSISTENT COMPUTATIONS
• Mathematical Foundations of Computer Science 2004
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• ASPECTS OF PERSISTENT COMPUTATIONS
• Title not available (Why is that?)
• Question answering by humans and machines: a complexity-theoretic view
• Computing with continuous change

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)