Book Chapter10.1007/3-540-18170-9_163
A setting for generalized computability
Giorgio Germano,Stefano Mazzanti +1 more
- 01 Jun 1987
- pp 154-165
5
About: The article was published on 01 Jun 1987. The article focuses on the topics: Computable function & Computability logic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
General iteration and unary functions
Giorgio Germano,Stefano Mazzanti +1 more
TL;DR: This work suggests a notion of general iteration corresponding to the while-do construct, which leads to new characterizations of general computable unary functions usable in computer science.
10
Succinct iterative characterizations of primitive computable unary functions
TL;DR: Primitive computable unary functions are useful patterns for the definition of for-do programs and are characterized as the closure of four simple unARY functions with respect to composition and primitive iteration.
2
An iterative characterization of computable functions on hyperwords of natural numbers
G. Germano,S. Mazzanti +1 more
- 01 Jan 2000
TL;DR: The set of words on a given alphabet is a well know data type which occurs in most of programming languages and can be generalized to the notion of hyperword, by allowing that a word can be used as a new letter to construct new words.
Primitive iteration and unary functions
Giorgio Germano,Stefano Mazzanti +1 more
TL;DR: A general notion of primitive iteration which subsumes the for-until-do construct as well as all known primative iteration operators is suggested, which leads to new iterative characterizations of primitive computable functions usable in computer science.
References
Primitive iteration and unary functions
Giorgio Germano,Stefano Mazzanti +1 more
TL;DR: A general notion of primitive iteration which subsumes the for-until-do construct as well as all known primative iteration operators is suggested, which leads to new iterative characterizations of primitive computable functions usable in computer science.