A minimal rK-degree
| dc.contributor.author | RAICHEV, Alexander | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.date.accessioned | 2005-11-25T01:20:54Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:01Z | |
| dc.date.available | 2005-11-25T01:20:54Z | en_US |
| dc.date.available | 2017-01-23T07:00:01Z | |
| dc.date.issued | 2005-11-25T01:20:54Z | en_US |
| dc.description.abstract | We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence and that there is a random sequence with no minimal sequence rK-reducible to it. | en_US |
| dc.format.extent | 927151 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1901 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR31/05 | en_US |
| dc.title | A minimal rK-degree | en_US |
| dc.type | Technical Report | en_US |