Invertible Classes
| dc.contributor.author | JAIN, Sanjay | en_US |
| dc.contributor.author | NESSEL, Jochen | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.date.accessioned | 2005-12-08T07:17:18Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:02Z | |
| dc.date.available | 2005-12-08T07:17:18Z | en_US |
| dc.date.available | 2017-01-23T07:00:02Z | |
| dc.date.issued | 2005-12-08T07:17:18Z | en_US |
| dc.description.abstract | In this paper we consider how and when general recursive operators can be inverted. This is motivated by the fact that in many situations in real life, one is interested in finding causes from the results. We also introduce the notion of coverability, which allows us to get a simpler representative enumeration of operators which satisfy some nice properties. We consider four notions of inversion --- strong inversion, inversion, weak inversion and bounded weak inversion --- and show that these separate. We also considered three notions of enumerations of operators to cover a class in the sense that the behaviour of every general recursive operator on the class is met. These three notions are strong covering, covering and weak covering --- where an acceptable numbering weakly covers all classes. We seaprate the induced notions of coverability. We also consider some special classes such as recursively enumerable classes and periodic classes. We show some interesting properties such as these classes are strongly invertible. We also show that some recursively enumerable classes, but not the class of periodic functions, are coverable. | en_US |
| dc.format.extent | 603553 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1905 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR22/05 | en_US |
| dc.title | Invertible Classes | en_US |
| dc.type | Technical Report | en_US |