On actually computable bijections between ℕ and Q+

Jaume Paradís; Lluís Bibiloni; Pelegrí Viader

On actually computable bijections between ℕ and Q⁺

Jaume Paradís, Lluís Bibiloni, Pelegrí Viader

Departament de Didàctica de la Matemàtica i de les Ciències Experimentals

Producció científica: Contribució a revista › Article › Recerca › Avaluat per experts

6 Cites (Scopus)

Resum

We present three different ways of getting an actually computable enumeration of Q+ in the sense of being able to know exactly which rational occupies a given position and vice versa. The first enumeration is based on the Pierce expansion model for representing real numbers. The other two are based on regular continued fractions. © 1996 Kluwer Academic Publishers.

Idioma original	Anglès
Pàgines (de-a)	369-377
Revista	Order
Volum	13
Número	4
Estat de la publicació	Publicada - 1 de des. 1996

Com citar-ho

@article{aef56182f9c0420f81d6a39c65a898eb,

title = "On actually computable bijections between ℕ and Q+",

abstract = "We present three different ways of getting an actually computable enumeration of Q+ in the sense of being able to know exactly which rational occupies a given position and vice versa. The first enumeration is based on the Pierce expansion model for representing real numbers. The other two are based on regular continued fractions. {\textcopyright} 1996 Kluwer Academic Publishers.",

keywords = "Bijection, Continued fractions, Enumeration, Pierce expansions",

author = "Jaume Parad{\'i}s and Llu{\'i}s Bibiloni and Pelegr{\'i} Viader",

year = "1996",

month = dec,

day = "1",

language = "English",

volume = "13",

pages = "369--377",

number = "4",

}

TY - JOUR

T1 - On actually computable bijections between ℕ and Q+

AU - Paradís, Jaume

AU - Bibiloni, Lluís

AU - Viader, Pelegrí

PY - 1996/12/1

Y1 - 1996/12/1

N2 - We present three different ways of getting an actually computable enumeration of Q+ in the sense of being able to know exactly which rational occupies a given position and vice versa. The first enumeration is based on the Pierce expansion model for representing real numbers. The other two are based on regular continued fractions. © 1996 Kluwer Academic Publishers.

AB - We present three different ways of getting an actually computable enumeration of Q+ in the sense of being able to know exactly which rational occupies a given position and vice versa. The first enumeration is based on the Pierce expansion model for representing real numbers. The other two are based on regular continued fractions. © 1996 Kluwer Academic Publishers.

KW - Bijection

KW - Continued fractions

KW - Enumeration

KW - Pierce expansions

M3 - Article

SN - 0167-8094

VL - 13

SP - 369

EP - 377

JO - Order

JF - Order

IS - 4

ER -

On actually computable bijections between ℕ and Q+

Resum

Fingerprint

Com citar-ho

On actually computable bijections between ℕ and Q⁺