Are binary codings universal?

Complexity 1 (5):47-50 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursive events in random sequences.George Davie - 2001 - Archive for Mathematical Logic 40 (8):629-638.
On the computational power of random strings.Adam R. Day - 2009 - Annals of Pure and Applied Logic 160 (2):214-228.
Familiarity and apparent complexity of random shapes.Alvin G. Goldstein - 1961 - Journal of Experimental Psychology 62 (6):594.
Shift-complex sequences.Mushfeq Khan - 2013 - Bulletin of Symbolic Logic 19 (2):199-215.

Analytics

Added to PP
2013-11-21

Downloads
41 (#610,039)

6 months
1 (#1,597,699)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Cristian S. Calude
University of Auckland

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references