A Syntactical Definition of the [Figure presented.] Problem

Amihood Amir; Yaacov Choceka

doi:10.1080/00207168508803464

A Syntactical Definition of the [Figure presented.] Problem

Amihood Amir
, Yaacov Choceka

Department of Computer Science

Massachusetts Institute of Technology, Department of Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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 language	English
Pages (from-to)	217-228
Number of pages	12
Journal	International Journal of Computer Mathematics
Volume	17
Issue number	3-4
DOIs	https://doi.org/10.1080/00207168508803464
State	Published - Jan 1985

Keywords

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

Access to Document

10.1080/00207168508803464

Cite this

@article{882276917d864a3ebcf664bd8e5c4649,

title = "A Syntactical Definition of the [Figure presented.] Problem",

abstract = "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.",

keywords = "Loop-programs, PL-programs, Turing machines, deterministic machines, nondeterministic machines, polynomially computable functions",

author = "Amihood Amir and Yaacov Choceka",

year = "1985",

month = jan,

doi = "10.1080/00207168508803464",

language = "אנגלית",

volume = "17",

pages = "217--228",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

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

AU - Amir, Amihood

AU - Choceka, Yaacov

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 - https://www.scopus.com/pages/publications/84914838676

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 -

A Syntactical Definition of the [Figure presented.] Problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this