Algorithmic randomness.

Tracing some of the latest advancements in algorithmic randomness.

Bibliographic Details
Published in:Communications of the ACM Vol. 62; no. 5; pp. 70 - 81
Main Authors: Downey, Rod, Hirschfeldt, Denis R.
Format: Article
Published: Association for Computing Machinery May2019
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=137694573&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 137694573
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: May2019
      vid: 62
      iid: 5
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        137694573
        10.1145/3319408
      ppf: 70
      ppct: 11
      formats:
      tig:
        atl: Algorithmic randomness.
      aug:
        au:
          Downey, Rod
          Hirschfeldt, Denis R.
      su:
        Algorithmic randomness
        Kolmogorov complexity
        Mathematical sequences
        Infinity (Mathematics)
        Mathematical functions
        Computable functions
      sug:
        subj:
          Algorithmic randomness
          Kolmogorov complexity
          Mathematical sequences
          Infinity (Mathematics)
          Mathematical functions
          Computable functions
      ab: Tracing some of the latest advancements in algorithmic randomness.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2019
    holdings:
      @attributes:
        islocal: N