High Quality Content by WIKIPEDIA articles! In mathematics and computer science a tuple captures the intuitive notion of an ordered list of elements. Depending on the mathematical foundation chosen, the formal notion differs slightly. In set theory, an (ordered) n-tuple is a sequence (or ordered list) of n elements, where n is a positive integer. There is also one 0-tuple, which is just an empty sequence. When n is understood from context, an n-tuple is sometimes referred to just as tuple, but this practice is not common in set theory texts. An n-tuple is defined inductively using the construction of an ordered pair. In type theory, commonly used in programming languages, a tuple has a product type: not only is the length fixed, but also the types of the components have to be specified, thus the length alone is not sufficient to inductively define a notion.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.