## Journal of Symbolic Logic

### Time Polynomial in Input or Output

#### Abstract

We introduce the class PIO of functions computable in time that is polynomial in $\max\{\text{the length of input, the length of output}\}$, observe that there is no notation system for total PIO functions but there are notation systems for partial PIO functions, and give an algebra of partial PIO functions from binary strings to binary strings.

#### Article information

Source
J. Symbolic Logic, Volume 54, Issue 3 (1989), 1083-1088.

Dates
First available in Project Euclid: 6 July 2007

https://projecteuclid.org/euclid.jsl/1183743042

Mathematical Reviews number (MathSciNet)
MR1011194

Zentralblatt MATH identifier
0692.03026

JSTOR