On actually computable bijections between \(\mathbb N\) and \(\mathbb Q^+\) (Q1362582): Difference between revisions

The authors provide three computable enumerations of the positive rationals, for which one can determine the exact position of a given rational. One of these uses the Pierce expansion for real numbers, the second continued fractions and the third is based on the Stern-Brocot tree.