A syntactically simple language is proposed. The functions computable by this language are exactly those which are polynomially computable by Turing Machines. A similar nondeterministic language is also shown, thus enabling to define the [Figure presented.] problem as an equivalence problem of two languages.
- Turing machines
- deterministic machines
- nondeterministic machines
- polynomially computable functions