Abstract
We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/