[Cst-1b] Complexity - the EXP class

[M.Y.W.Y.B.]

--On Samstag, 27. Mai 2000, 18:56 +0100 "Matthew Richards" <mwr22@cam.ac.uk>
wrote: 

> I think EXP is the class of languages that can be accepted by a
> deterministic machine in exponential time.
[...]
> 
> I have no idea if that's the proof Dr Dawar intended, but it seems to
work.

That's 100% correct.