[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Linear bounded automaton

Hi all,

This question was probably answered long ago, but I can’t find a reference . . .

Is occam “linear bounded automaton complete”? (Presumably it’s not Turing
complete, because it has finite memory, but neither is anything else, really.
All real implementations of “Turing complete” languages have finite memory.)