Computer Science – Computational Complexity
Scientific paper
2012-04-04
Computer Science
Computational Complexity
10 pages + 8 pages appendix, cited in bib; published in CiE 2012
Scientific paper
Following work by Hochman and Meyerovitch on multidimensional SFT, we give
computability-theoretic characterizations of the real numbers that can appear
as the topological entropies of one-dimensional and two-dimensional cellular
automata.
Guillon Pierre
Zinoviadis Charalampos
No associations
LandOfFree
Densities and entropies in cellular automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Densities and entropies in cellular automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Densities and entropies in cellular automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32234