On elementary computability-theoretic properties of algorithmic randomness

Asat Arslanov

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    Original languageEnglish
    Title of host publicationProceedings of the Computing: The Australasian Theory Symposium (CATS 2001)
    EditorsC J Fidge
    Place of Publicationwww.elsevier.nl/locate/entcs/volume42.html
    PublisherElsevier
    Pages41 - 51
    Number of pages11
    Volume23
    Edition3
    ISBN (Print)0304-3975
    Publication statusPublished - 2001
    EventComputing: the Australasian Theory Symposium 2001 - , Australia
    Duration: 29 Jan 20011 Feb 2001
    http://www.elsevier.nl/locate/entcs/volume42.html

    Conference

    ConferenceComputing: the Australasian Theory Symposium 2001
    Abbreviated titleCATS 2001
    CountryAustralia
    Period29/01/011/02/01
    Internet address

    Cite this

    Arslanov, A. (2001). On elementary computability-theoretic properties of algorithmic randomness. In C. J. Fidge (Ed.), Proceedings of the Computing: The Australasian Theory Symposium (CATS 2001) (3 ed., Vol. 23, pp. 41 - 51). Elsevier.