Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.tcs.2007.05.017
| Title: | Invertible classes | Authors: | Jain, S. Nessel, J. Stephan, F. |
Issue Date: | 2007 | Citation: | Jain, S., Nessel, J., Stephan, F. (2007). Invertible classes. Theoretical Computer Science 384 (1) : 49-65. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tcs.2007.05.017 | Abstract: | This paper considers when one can invert general recursive operators which map a class of functions F to F. In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map F to F in the sense that, for every general recursive operator Ψ mapping F to F, there is a general recursive operator in the enumerated sequence which behaves the same way as Ψ on F. Three different possible types of enumeration are studied. © 2007 Elsevier Ltd. All rights reserved. | Source Title: | Theoretical Computer Science | URI: | http://scholarbank.nus.edu.sg/handle/10635/43095 | ISSN: | 03043975 | DOI: | 10.1016/j.tcs.2007.05.017 |
| 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.