All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On Resource-Bounded Versions of the van Lambalgen Theorem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10367159" target="_blank" >RIV/00216208:11320/17:10367159 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-55911-7_10" target="_blank" >http://dx.doi.org/10.1007/978-3-319-55911-7_10</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-55911-7_10" target="_blank" >10.1007/978-3-319-55911-7_10</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Resource-Bounded Versions of the van Lambalgen Theorem

  • Original language description

    The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences A and B, B is Martin-Löf random and A is Martin-Löf random relative to B if and only if the interleaved sequence is Martin-Löf random. This implies that A is relative random to B if and only if B is random relative to A. This paper studies the validity of this phenomenon for different notions of time-bounded relative randomness.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    R - Projekt Ramcoveho programu EK

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017

  • ISBN

    978-3-319-55910-0

  • ISSN

    0302-9743

  • e-ISSN

    neuvedeno

  • Number of pages

    15

  • Pages from-to

    129-143

  • Publisher name

    SPRINGER

  • Place of publication

    Cham, Switzerland

  • Event location

    Bern, Switzerland

  • Event date

    Apr 20, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article