Mitotic Classes
| dc.contributor.author | JAIN, Sanjay | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.date.accessioned | 2007-08-21T03:16:07Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:24Z | |
| dc.date.available | 2007-08-21T03:16:07Z | en_US |
| dc.date.available | 2017-01-23T07:00:24Z | |
| dc.date.issued | 2007-08-21T03:16:07Z | en_US |
| dc.description.abstract | For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in the case of learnable classes. Here the strength of the classes is compared using the strong and weak reducibility from intrinsic complexity. It is shown that, for explanatorily learnable classes, the complete classes are also mitotic with respect to weak and strong reducibility, respectively. But there is a weak complete class which cannot be split into two classes which are of the same complexity with respect to strong reducibility. It is shown that for complete classes for behaviourally correct learning, one half of each splitting is complete for this learning notion as well. Furthermore, it is shown that explanatorily learnable and recursively enumerable classes always have a splitting into two incomparable classes; this gives an inductive inference counterpart of Sacks Splitting Theorem from recursion theory. | en_US |
| dc.format.extent | 398276 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2569 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB8/07 | en_US |
| dc.title | Mitotic Classes | en_US |
| dc.type | Technical Report | en_US |