Multiple recurrence conjecture for computable commuting transformations
Multiple recurrence conjecture for computable commuting transformations
Let be a computable probability space. Let be computable measure-preserving transformations that commute pairwise. Let be a class with . A point is Martin-Löf random if it avoids every effectively null test. Multiple recurrence conjecture. If is Martin-Löf random, then there exists such that
This is a proposed extension of multiple recurrence to computable probability spaces and computable pairwise commuting measure-preserving transformations. The supplied text calls the result “putative” and gives no evidence of a resolution.
Sources & referencesView supporting material
Primary source
Andre Nies, “Logic Blog 2015f”, arXiv:1602.04432 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.