Skip to main content
Article thumbnail
Location of Repository

Function Algebraic Characterizations Of The Polytime Functions

By Hajime Ishihara


. We give function algebraic characterizations of the polynomial time computable functions using unbounded recursion schemes without introducing extra notions such as safe and normal in variables and tiering in word algebras. Key words. polytime functions, function algebras, recursion schemes. Subject classications. 68Q15. 1. Introduction Cobham (1965) characterized the class Fptime of polynomial time computable functions as the smallest class of functions containing certain initial functions, and closed under composition and the following variant of primitive recursion: the function f is dened by bounded recursion on notation (brn) from g; h 0 ; h 1 ; k if f(0; ~y) = g(~y); f(s 0 (x); ~y) = h 0 (x; ~y; f(x; ~y)); (if x 6= 0) f(s 1 (x); ~y) = h 1 (x; ~y; f(x; ~y)) provided that f(x; ~y) k(x; ~y) for all x; ~y, where s 0 and s 1 are the binary successor functions with s 0 (x) = 2 x and s 1 (x) = 2 x + 1. Although Cobham's characterization has been fruitful and yielded a ..

Topics: Subject classications. 68Q15
Year: 1999
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.