Article
Licensed
Unlicensed
Requires Authentication
On the complexity of the ℰ2 Grzegorczyk class
-
S. S. Marchenkov
Published/Copyright:
March 18, 2010
Abstract
We define several abstract computing devices which allow us to characterise the ℰ2 class of the Grzegorczyk hierarchy. For each of these devices, we estimate the time needed to compute functions of the class ℰ2.
Received: 2009-09-09
Published Online: 2010-03-18
Published in Print: 2010-March
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
Articles in the same Issue
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
