|
|
|
|
|
|
by luc4
1035 days ago
|
|
|
> The class of problems solvable in a finite amount of memory is just the class of regular languages. The “finite memory” is the finite state machine used to solve them. I think they meant to say "constant memory" since every halting Turing Machine uses finite memory. |
|
|