>>11913161I mean, you can define a Turing machine with any arbitrary finite set of tape or input symbols. Either way, you can force them all to count exponentially far regardless of the tape alphabet by considering the unary language (the language of only 1 symbol), where the amount of symbols encodes the number.
>>11913206>This is a over complicated explanationthat is useless.this is literally an abbreviated explanation of the proof that EXPTIME is a subset of EXPSPACE but not equal. No step in this explanation is complicated.
> to say solve a problem, the more space needed, the more time needed to create the space, think dynamic allocation of new memory continuously. Exponential would refer to the time being exponetial such that the big Onotation is O(2^n). And you think *my* explanation was contrived? Learn English lmao
