Skip to main content
5 events
when toggle format what by license comment
Apr 24, 2020 at 15:45 history made wiki Post Made Community Wiki by Todd Trimble
Apr 24, 2020 at 15:19 comment added Wojowu While computing a continued fraction is certainly a computational task, showing that a continued fraction has bounded coefficients certainly is not, and I don't see how you could in any reasonable sense "compute" such a number.
Apr 24, 2020 at 14:56 comment added Stanley Yao Xiao The question allows for the prospect of computing the existence of an object, and constructing such an algebraic integer could be considered as such. Further, computing the continued fraction expansion of a given real number is, by nature, computational.
Apr 24, 2020 at 14:55 comment added JoshuaZ What is the computational aspect of this problem?
Apr 24, 2020 at 14:52 history answered Stanley Yao Xiao CC BY-SA 4.0