Back to Results
First PageMeta Content
Theoretical computer science / Randomness / Computer science / Algorithmically random sequence / Computable number / Computable function / Per Martin-Löf / Random sequence / Continuous function / Mathematics / Theory of computation / Computability theory


The Denjoy alternative for computable functions Laurent Bienvenu1 , Rupert Hölzl∗2 , Joseph S. Miller†3 , and André Nies4 1,2 LIAFA, CNRS & Université de Paris 7, Case 7014, 75205 Paris Cedex 13, France laurent.bi
Add to Reading List

Document Date: 2012-02-24 06:03:31

Open Document

File Size: 630,31 KB

Share Result on Facebook

Company

Creative Commons / Saks / Dagstuhl Publishing / /

Country

Germany / /

/

Event

Product Recall / Product Issues / /

Facility

University of Auckland / University of Wisconsin / /

Organization

Department of Mathematics / University of Wisconsin / Madison / National Science Foundation / University of Auckland / Department of Computer Science / /

Person

Thomas Wilke / Rupert Hölzl / André Nies / Joseph S. Miller / Laurent Bienvenu / Christoph Dürr / /

Position

author / second author / /

Product

Franklin / definitions of Martin-Löf randomness / definitions / /

Technology

dom / Digital Object Identifier / /

SocialTag