In this paper we consider wordsequence functions, i.e., functions of the type ƒ ƒ: Σ ∗ ′ → Σ ∗ ‵ where Σ is a finite alphabet and r ⩾ 0, s > 0.
HIERARCHIES OF PRIMITIVE RECURSIVE. WORDSEQUENCE IXJNCTIONS: COMPARISONS AND DECISION PROBLEMS. E. FACHINI and M. NAPOLI. Istituto di Scienze dell ...
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems · Mathematics, Computer Science. Theor. Comput. Sci. · 1984.
People also ask
What is a primitive recursive function?
What is the complexity of a primitive recursive function?
Is subtraction a primitive recursive function?
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems · Mathematics, Computer Science. Theoretical Computer Science · 1984.
Comparing Hierarchies of Primitive Recursive Sequence Functions ... Moscarini On the complexity of decision problems for classes of simple programs on strings.
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems · Emanuela Fachini,Margherita Napoli +1 moreUniversity of Salerno.
We define some hierarchies of length ~,a'of these functions by bounding the number of successive compositions and the depth of the nested iterations in the ...
Aug 20, 2024 · Primitive recursion is a key concept in computability theory, providing a method for defining functions on natural numbers.
Missing: Comparisons | Show results with:Comparisons
If we consider the subclasses J^L+bi^ma.+ b of functions Nr -> N we can compare our hierarchy with the known hiérarchies of primitive recursive functions ...
Missing: Decision | Show results with:Decision
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems. December 1984 · Theoretical Computer Science. Emanuela Fachini ...