Computability of Brjuno-like functions

In his seminal paper from 1936, Alan Turing introduced the concept of non-computable real numbers and presented examples based on the algorithmically unsolvable Halting problem. We describe a different, analytically natural mechanism for the appearance of non-computability. Namely, we show that additive sampling of orbits of certain skew products over expanding dynamics produces Turing non-computable reals. We apply this framework to Brjuno-type functions to demonstrate that they realize bijections between computable and lower-computable numbers, generalizing previous results of M. Braverman and the second author for the Yoccoz-Brjuno function to a wide class of examples, including Wilton's functions and generalized Brjuno functions.

No reviews yet.

No comments yet.