On multiply-exponential write-once Turing machines

Maciej Zielenkiewicz, Aleksy Schubert, Jacek Chrząszcz

In this work we analyze the multiply-exponential complexity classes for write-once Turing machines, i.e. machines that can write to a given tape cell at most once. We show that $k$…