Randomness, computability and algebraic specifications

Annals of Pure and Applied Logic 91 (1):1-15 (1998)
  Copy   BIBTEX

Abstract

This paper shows how the notion of randomness defines, in a natural way, an algebra. It turns out that the algebra is computably enumerable and finitely generated. The paper investigates algebraic and effective properties of this algebra

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00040-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

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

Through your library

My notes

Similar books and articles

Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Review: Dimiter G. Skordev, Computability in Combinatory Spaces. An Algebraic Generalization of Abstract First Order Computability. [REVIEW]Dag Normann - 1995 - Journal of Symbolic Logic 60 (2):695-696.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
On P Versus NP for Parameter‐Free Programs Over Algebraic Structures.Armin Hemmerling - 2001 - Mathematical Logic Quarterly 47 (1):67-92.
REVIEWS-A. Nies, Computability and randomness.Anthony Morphett - 2010 - Bulletin of Symbolic Logic 16 (1).
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
Randomness and the linear degrees of computability.Andrew Em Lewis & George Barmpalias - 2007 - Annals of Pure and Applied Logic 145 (3):252-257.
Algorithmic randomness of continuous functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.
Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.
Logic, Computability, and Randomness.Verónica Becher - 2005 - Bulletin of Symbolic Logic 11 (4):557-557.
Computable and continuous partial homomorphisms on metric partial algebras.Viggo Stoltenberg-Hansen & John V. Tucker - 2003 - Bulletin of Symbolic Logic 9 (3):299-334.
Effective algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.

Analytics

Added to PP
2014-01-16

Downloads
20 (#765,631)

6 months
5 (#632,816)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references