Premium
Iterative Characterizations of Computable Unary Functions: A General Method
Author(s) -
Mazzanti Stefano
Publication year - 1997
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19970430104
Subject(s) - unary operation , mathematics , class (philosophy) , pairing , characterization (materials science) , iterative method , discrete mathematics , computable function , algebra over a field , theoretical computer science , algorithm , pure mathematics , computer science , artificial intelligence , physics , superconductivity , materials science , quantum mechanics , nanotechnology
Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving very nice features.