TY - JOUR

T1 - A Syntactical Definition of the [Figure presented.] Problem

AU - Amir, Amihood

PY - 1985/1

Y1 - 1985/1

N2 - 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.

AB - 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.

KW - Loop-programs

KW - PL-programs

KW - Turing machines

KW - deterministic machines

KW - nondeterministic machines

KW - polynomially computable functions

UR - http://www.scopus.com/inward/record.url?scp=84914838676&partnerID=8YFLogxK

U2 - 10.1080/00207168508803464

DO - 10.1080/00207168508803464

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84914838676

SN - 0020-7160

VL - 17

SP - 217

EP - 228

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3-4

ER -