Please use this identifier to cite or link to this item:
https://doi.org/10.1007/11750321_67
| Title: | Invertible classes | Authors: | Jain, S. Nessel, J. Stephan, F. |
Issue Date: | 2006 | Citation: | Jain, S.,Nessel, J.,Stephan, F. (2006). Invertible classes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3959 LNCS : 707-720. ScholarBank@NUS Repository. https://doi.org/10.1007/11750321_67 | Abstract: | This paper considers when one can invert general recursive operators which map a class of functions ℱ to ℱ. In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map ℱ to ℱ in the sense that for every general recursive operator ψ mapping ℱ to ℱ, there is a general recursive operator in the enumerated sequence which behaves the same way as ψ on ℱ. Three different possible types of enumeration are studied. © Springer-Verlag Berlin Heidelberg 2006. | Source Title: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | URI: | http://scholarbank.nus.edu.sg/handle/10635/43284 | ISBN: | 3540340211 | ISSN: | 03029743 | DOI: | 10.1007/11750321_67 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.