Skip to main content
Conference Proceedings

Non-deterministic halting times for Hamkins-Kidder turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3988 LNCS 571-574
DOI: 10.1007/11780342_58
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Welch, P. D. (2006). Non-deterministic halting times for Hamkins-Kidder turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 571–574). Springer Verlag. https://doi.org/10.1007/11780342_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free