2010
DOI: 10.1515/dma.2010.003
|View full text |Cite
|
Sign up to set email alerts
|

On the complexity of the ℰ2 Grzegorczyk class

Abstract: We define several abstract computing devices which allow us to characterise the E 2 class of the Grzegorczyk hierarchy. For each of these devices, we estimate the time needed to compute functions of the class E 2 . Grzegorczyk introduced in [11] a classification of the set of primitive recursive functions which have found a widespread use. Among the classes E n of this classification, the classes E 2 and E 3 are of particular interest. The class E 3 is the class of functions which are elementary following Kalm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 7 publications
0
0
0
Order By: Relevance