What Is a Random String?
| dc.creator | Calude,Cristian S. | |
| dc.date | 1995 | |
| dc.date.accessioned | 2024-02-06T12:47:34Z | |
| dc.date.available | 2024-02-06T12:47:34Z | |
| dc.description | Chaitin s algorithmic definition of random strings - based on the complexity induced by self-delimiting computers - is critically discussed. One shows that Chaitin s model satisfy many natural requirements related to randomness, so it can be considered as an adequate model for finite random objects. It is a better model than the original (Kolmogorov) proposal. Finally, some open problems will be discussed. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-001-01-0048 | |
| dc.identifier | https://lib.jucs.org/article/27082/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6726 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 1(1): 48-66 | |
| dc.subject | Blank-endmarker complexity | |
| dc.subject | Chaitin (self-delimiting) complexity | |
| dc.subject | random strings. | |
| dc.title | What Is a Random String? | |
| dc.type | Research Article |