Statistical properties of finite sequences with high Kolmogorov complexity View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

1994-07

AUTHORS

Ming Li, Paul M. B. Vitányi

ABSTRACT

We investigate to what extent finite binary sequences with high Kolmogorov complexity are normal (all blocks of equal length occur equally frequently), and the maximal length of all-zero or all-one runs which occur with certainty.

PAGES

365-376

Journal

TITLE

Mathematical Systems Theory

ISSUE

4

VOLUME

27

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf01192146

DOI

http://dx.doi.org/10.1007/bf01192146

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1053046483


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Waterloo", 
          "id": "https://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Computer Science Department, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Li", 
        "givenName": "Ming", 
        "id": "sg:person.0621576316.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0621576316.79"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Centrum Wiskunde and Informatica", 
          "id": "https://www.grid.ac/institutes/grid.6054.7", 
          "name": [
            "Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Vit\u00e1nyi", 
        "givenName": "Paul M. B.", 
        "id": "sg:person.014213763741.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014213763741.01"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0019-9958(66)80018-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002020706"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/b978-0-444-88071-0.50009-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002142285"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/321892.321894", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008642010"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0097-3165(94)90064-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019398427"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1070/rm1983v038n04abeh004203", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1058195081"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1132061", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062868085"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1994-07", 
    "datePublishedReg": "1994-07-01", 
    "description": "We investigate to what extent finite binary sequences with high Kolmogorov complexity are normal (all blocks of equal length occur equally frequently), and the maximal length of all-zero or all-one runs which occur with certainty.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01192146", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1317508", 
        "issn": [
          "0025-5661"
        ], 
        "name": "Mathematical Systems Theory", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "27"
      }
    ], 
    "name": "Statistical properties of finite sequences with high Kolmogorov complexity", 
    "pagination": "365-376", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "fcac98fb7fe77832c3110e6bf517b2000d2ef7a9f391f737202a7bf450977b88"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01192146"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1053046483"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01192146", 
      "https://app.dimensions.ai/details/publication/pub.1053046483"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T13:32", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000370_0000000370/records_46760_00000002.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF01192146"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf01192146'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf01192146'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf01192146'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf01192146'


 

This table displays all metadata directly associated to this object as RDF triples.

80 TRIPLES      20 PREDICATES      31 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01192146 schema:author N42b6f69f6abd4ced9acc625d1c76d7f7
2 schema:citation https://doi.org/10.1016/0097-3165(94)90064-7
3 https://doi.org/10.1016/b978-0-444-88071-0.50009-6
4 https://doi.org/10.1016/s0019-9958(66)80018-9
5 https://doi.org/10.1070/rm1983v038n04abeh004203
6 https://doi.org/10.1137/1132061
7 https://doi.org/10.1145/321892.321894
8 schema:datePublished 1994-07
9 schema:datePublishedReg 1994-07-01
10 schema:description We investigate to what extent finite binary sequences with high Kolmogorov complexity are normal (all blocks of equal length occur equally frequently), and the maximal length of all-zero or all-one runs which occur with certainty.
11 schema:genre research_article
12 schema:inLanguage en
13 schema:isAccessibleForFree true
14 schema:isPartOf N21710ee60fa442a3a542eeda361e9542
15 N9ddca6f65e4b4709893d03cd4d69fa39
16 sg:journal.1317508
17 schema:name Statistical properties of finite sequences with high Kolmogorov complexity
18 schema:pagination 365-376
19 schema:productId N2c84dd214ae545aabb17d0b33b30ef95
20 Nac8c76a4963e45ecbf9dddbb7f92de35
21 Nb5eea7891e944edcb690300317596f9a
22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053046483
23 https://doi.org/10.1007/bf01192146
24 schema:sdDatePublished 2019-04-11T13:32
25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
26 schema:sdPublisher N3577abead4414a27a9762c1fab5d7d35
27 schema:url http://link.springer.com/10.1007/BF01192146
28 sgo:license sg:explorer/license/
29 sgo:sdDataset articles
30 rdf:type schema:ScholarlyArticle
31 N15ff26d07e8740fabb03c74846d3712b rdf:first sg:person.014213763741.01
32 rdf:rest rdf:nil
33 N21710ee60fa442a3a542eeda361e9542 schema:volumeNumber 27
34 rdf:type schema:PublicationVolume
35 N2c84dd214ae545aabb17d0b33b30ef95 schema:name dimensions_id
36 schema:value pub.1053046483
37 rdf:type schema:PropertyValue
38 N3577abead4414a27a9762c1fab5d7d35 schema:name Springer Nature - SN SciGraph project
39 rdf:type schema:Organization
40 N42b6f69f6abd4ced9acc625d1c76d7f7 rdf:first sg:person.0621576316.79
41 rdf:rest N15ff26d07e8740fabb03c74846d3712b
42 N9ddca6f65e4b4709893d03cd4d69fa39 schema:issueNumber 4
43 rdf:type schema:PublicationIssue
44 Nac8c76a4963e45ecbf9dddbb7f92de35 schema:name readcube_id
45 schema:value fcac98fb7fe77832c3110e6bf517b2000d2ef7a9f391f737202a7bf450977b88
46 rdf:type schema:PropertyValue
47 Nb5eea7891e944edcb690300317596f9a schema:name doi
48 schema:value 10.1007/bf01192146
49 rdf:type schema:PropertyValue
50 sg:journal.1317508 schema:issn 0025-5661
51 schema:name Mathematical Systems Theory
52 rdf:type schema:Periodical
53 sg:person.014213763741.01 schema:affiliation https://www.grid.ac/institutes/grid.6054.7
54 schema:familyName Vitányi
55 schema:givenName Paul M. B.
56 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014213763741.01
57 rdf:type schema:Person
58 sg:person.0621576316.79 schema:affiliation https://www.grid.ac/institutes/grid.46078.3d
59 schema:familyName Li
60 schema:givenName Ming
61 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0621576316.79
62 rdf:type schema:Person
63 https://doi.org/10.1016/0097-3165(94)90064-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019398427
64 rdf:type schema:CreativeWork
65 https://doi.org/10.1016/b978-0-444-88071-0.50009-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002142285
66 rdf:type schema:CreativeWork
67 https://doi.org/10.1016/s0019-9958(66)80018-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002020706
68 rdf:type schema:CreativeWork
69 https://doi.org/10.1070/rm1983v038n04abeh004203 schema:sameAs https://app.dimensions.ai/details/publication/pub.1058195081
70 rdf:type schema:CreativeWork
71 https://doi.org/10.1137/1132061 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062868085
72 rdf:type schema:CreativeWork
73 https://doi.org/10.1145/321892.321894 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008642010
74 rdf:type schema:CreativeWork
75 https://www.grid.ac/institutes/grid.46078.3d schema:alternateName University of Waterloo
76 schema:name Computer Science Department, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
77 rdf:type schema:Organization
78 https://www.grid.ac/institutes/grid.6054.7 schema:alternateName Centrum Wiskunde and Informatica
79 schema:name Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands
80 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...