Answers are grounded in this paper and cite their sources.
We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t2(n) is a time-constructible function and t2(n) grows faster than t1(n+1), then there exists a language which can be accepted by a t2(n)-time nondeterministic cellular automaton but not by any t1(n)-time nondeterministic cellular automaton.
No takes yet. Share an insight, caveat, or question.
Iwamoto et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: