A Syntactical Definition of the [Figure presented.] Problem

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish
Pages (from-to)217-228
Number of pages12
JournalInternational Journal of Computer Mathematics
Issue number3-4
StatePublished - Jan 1985


  • Loop-programs
  • PL-programs
  • Turing machines
  • deterministic machines
  • nondeterministic machines
  • polynomially computable functions


Dive into the research topics of 'A Syntactical Definition of the [Figure presented.] Problem'. Together they form a unique fingerprint.

Cite this