## Abstract 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
Bounded iteration and unary functions
β Scribed by Stefano Mazzanti
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 111 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The set of unary functions of complexity classes defined by using bounded primitive recursion is inductively characterized by means of bounded iteration. Elementary unary functions, linear space computable unary functions and polynomial space computable unary functions are then inductively characterized using only composition and bounded iteration. (Β© 2004 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
We shall investigate certain statements concerning the rigidity of unary functions which have connections with (weak) forms of the axiom of choice.
## Abstract It is known that, if __u__ is a real valued function on β^__N__^ of bounded variation, then its total variation decreases under polarization. In this paper we identify the difference between the total variation of __u__ and that one of its polar __u__~Ξ ~ (Β© 2009 WILEYβVCH Verlag GmbH &
## Abstract In this paper we consider extensions of bounded vectorβvalued holomorphic (or harmonic or pluriharmonic) functions defined on subsets of an open set Ξ© β β^__N__^ . The results are based on the description of vectorβvalued functions as operators. As an application we prove a vectorβvalue