About: Pair sequence number   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Pair sequence number is a the output of a program made by BashicuHyudora and posted at a googology-related thread of the Japanese site BBS 2ch.net in 2014. The algorithm of the program is called the pair sequence system, a weak version of Bashicu's matrix system by the same creator. It is supposed to calculate number comparable to \(f_{\vartheta(\Omega_\omega)+1}(10)\). It is an extension of a system named the primitive sequence system, still by the same author, which generates a number approaching \(f_{\varepsilon_0+1}(10)\).

AttributesValues
rdfs:label
  • Pair sequence number
rdfs:comment
  • Pair sequence number is a the output of a program made by BashicuHyudora and posted at a googology-related thread of the Japanese site BBS 2ch.net in 2014. The algorithm of the program is called the pair sequence system, a weak version of Bashicu's matrix system by the same creator. It is supposed to calculate number comparable to \(f_{\vartheta(\Omega_\omega)+1}(10)\). It is an extension of a system named the primitive sequence system, still by the same author, which generates a number approaching \(f_{\varepsilon_0+1}(10)\).
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • Pair sequence number is a the output of a program made by BashicuHyudora and posted at a googology-related thread of the Japanese site BBS 2ch.net in 2014. The algorithm of the program is called the pair sequence system, a weak version of Bashicu's matrix system by the same creator. It is supposed to calculate number comparable to \(f_{\vartheta(\Omega_\omega)+1}(10)\). It is an extension of a system named the primitive sequence system, still by the same author, which generates a number approaching \(f_{\varepsilon_0+1}(10)\). A pair sequence is a finite sequence of pairs of nonnegative integers, for example (0,0)(1,1)(2,2)(3,3)(3,2). A pair sequence P works as a function from natural numbers to natural numbers, (though we write P[n] rather than P(n)), for example \(n \mapsto (0,0)(1,1)(2,2)(3,3)(3,2)[n]\) is a function. The function P[n] is usually approximated with a function of the form \(H_\alpha\) from the Hardy hierarchy (we note \(P = \alpha\)). For example, \((0,0)(1,1)(2,2)(3,3)(3,2) = \psi(\psi_1(\Omega_2))\).
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software