Del 51 - Oxford Logic Guides
Computability and Randomness
Inbunden, Engelska, 2009
Av André Nies, The University of Aukland) Nies, Andre (, Senior Lecturer, Department of Computer Science
2 549 kr
Beställningsvara. Skickas inom 10-15 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.Finns i fler format (1)
The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory.Covering the basics as well as recent research results, this book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
Produktinformation
- Utgivningsdatum2009-01-29
- Mått162 x 239 x 27 mm
- Vikt811 g
- FormatInbunden
- SpråkEngelska
- SerieOxford Logic Guides
- Antal sidor450
- FörlagOUP OXFORD
- ISBN9780199230761
Tillhör följande kategorier
Hoppa över listan
Mer från samma författare
Hoppa över listan
Du kanske också är intresserad av
Del 51
Del 21
Del 30
Del 53
Del 50
Del 22
Del 44
Del 36
Twenty Five Years of Constructive Type Theory
Giovanni Sambin, Jan M. Smith, Italy) Sambin, Giovanni (Professor of Mathematical Logic, Professor of Mathematical Logic, University of Padua, Sweden) Smith, Jan M. (Professor, Department of Computing Science, Professor, Department of Computing Science, Chalmers University of Technology, Jan Smith, Jan M Smith
1 669 kr
Del 48
Del 47