Skip to main content
Conference Proceedings

Universality and the halting problem for cellular automata in hyperbolic spaces: The side of the halting problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7445 LNCS 12-33
DOI: 10.1007/978-3-642-32894-7_5
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we remind results on universality for cellular automata in hyperbolic spaces, mainly results about weak universality, and we deal with the halting problem in the same settings. This latter problem is very close to that of strong universality. The paper focuses on the halting problem and it can be seen as a preliminary approach to strong universality about cellular automata in hyperbolic spaces. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Margenstern, M. (2012). Universality and the halting problem for cellular automata in hyperbolic spaces: The side of the halting problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7445 LNCS, pp. 12–33). https://doi.org/10.1007/978-3-642-32894-7_5

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