[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 342-347

B. Kapron , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

ABSTRACT

A. Cobham (1964) presented a machine-independent characterization of computational feasibility, via inductive definition. R. Constable (1973) was apparently the first to consider the notion of feasibility for type 2 functionals. K. Mehlhorn's (1976) study of feasible reducibilities proceeds from Constable's work. Here, a class of polytime operators is defined, using a generalization of Cobham's definition. The authors provide an affirmative answer to the question of whether there is a natural machine based definition of Mehlhorn's class.

INDEX TERMS

polytime operators, Mehlhorn's polynomial time functionals, machine-independent characterization, computational feasibility, inductive definition, feasibility, type 2 functionals

CITATION

B. Kapron and S. Cook, "A new characterization of Mehlhorn's polynomial time functionals,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 342-347.

doi:10.1109/SFCS.1991.185389

CITATIONS