cylindrification
≈ 1 min read
Names in other languages
- Englishcylindrification
- Portuguêscilindrificação
- Portuguêscilindrificação
- 中文圓柱化
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computability theory a cylindrification is a construction that associates a cylindric numbering to each numbering. The concept was first introduced by Yuri L. Ershov in 1973.
In computability theory a cylindrification is a construction that associates a cylindric numbering to each numbering. The concept was first introduced by Yuri L. Ershov in 1973. \mathrm{Domain}(c(\nu)) := \{\langle n, k \rangle | n \in \mathrm{Domain}(\nu)\} c(\nu)\langle n, k \rangle := \nu(n) where \langle n, k \rangle is the Cantor pairing function. Note that the cylindrification operation increases the input arity by 1.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1043243193 under CC BY-SA 4.0; modifications have been made.