Randomness in Computability Theory
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F00%3A00001057" target="_blank" >RIV/00216208:11320/00:00001057 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Randomness in Computability Theory
Original language description
We discuss some aspects of algorithmic randomness and state some open problems in this area. The first part is devoted to the question 'What is a computably random sequence?' Here we survey some of the approaches to algorithmic randomness.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2000
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
Computability Theory and Its Applications
ISBN
0-8218-1922-4
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
—
Publisher name
American Mathematical Society
Place of publication
Providence, Rhode Island
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—