Abstract
a = 1, a+ = 2U(n,c '), i > O. Then U(n + ?, c) = ac . In order to get some idea of the rate of growth of U(n, c) (and of the functions which will be introduced later in this paper), we shall define the classes of the Grzegorczyk hierarchy. For each n E N, define a function En by Eo(x, y) = x + y, E1 (x) = x2 + 2, En+2(0) = 2, En,2 (x + 1) = En+ I (En+2 () Then, for example, 2 2x< E2 (X) < 3 3 *~~~~ v Presented at a meeting of the British Mathematics Colloquium; received by the editors February 10, 1988. 1980 Mathematics Subject Classification (1985 Revision). Primary 05A99; Secondary 1 5A03.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
