Algorithmic Randomness : Progress and Prospects

Saved in:

Bibliographic Details
Title:	Algorithmic Randomness : Progress and Prospects
Description:	The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.
Authors:	Johanna N. Y. Franklin, Christopher P. Porter
Resource Type:	eBook.
Subjects:	Computational complexity
Categories:	MATHEMATICS / Logic
Database:	eBook Collection (EBSCOhost)

FullText	Links: – Type: ebook-pdf Text: Availability: 0
Header	DbId: nlebk DbLabel: eBook Collection (EBSCOhost) An: 2986241 RelevancyScore: 1097 AccessLevel: 6 PubType: eBook PubTypeId: ebook PreciseRelevancyScore: 1096.64697265625
IllustrationInfo
ImageInfo	– Size: thumb Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2986241$PDF&s=r – Size: medium Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$2986241$PDF&s=d
Items	– Name: Title Label: Title Group: Ti Data: Algorithmic Randomness : Progress and Prospects – Name: Abstract Label: Description Group: Ab Data: The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Johanna+N%2E+Y%2E+Franklin%22">Johanna N. Y. Franklin</searchLink><br /><searchLink fieldCode="AR" term="%22Christopher+P%2E+Porter%22">Christopher P. Porter</searchLink> – Name: TypePub Label: Resource Type Group: TypPub Data: eBook. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: SubjectBISAC Label: Categories Group: Su Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Logic%22">MATHEMATICS / Logic</searchLink>
PLink	https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=2986241
RecordInfo	BibRecord: BibEntity: Classifications: – Code: 511.3 Scheme: ddc Type: prePub Languages: – Code: eng Text: English Subjects: – SubjectFull: Computational complexity Type: general Titles: – TitleFull: Algorithmic Randomness : Progress and Prospects Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Johanna N. Y. Franklin – PersonEntity: Name: NameFull: Christopher P. Porter – PersonEntity: Name: NameFull: Johanna N. Y. Franklin – PersonEntity: Name: NameFull: Christopher P. Porter IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2020 – D: 29 M: 09 Type: profile Y: 2021 Identifiers: – Type: isbn-print Value: 9781108478984 – Type: isbn-electronic Value: 9781108808279 Titles: – TitleFull: Algorithmic Randomness : Progress and Prospects Type: main
ResultId	1