About: Sudan function   Sponge Permalink

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

Sudan function is a fast growing function discovered by Gabriel Sudan. It is similar to the Ackermann function (but less well-known) and formally defined as follows: \(F_0(x,y) = x+y\) \(F_{n+1}(x,0) = x\) (for \(n \geq 0\)) \(F_{n+1}(x,y+1) = F_n(F_{n+1}(x,y),F_{n+1}(x,y)+y+1)\) (for \(n \geq 0,y \geq 0\)) It has been proven that the function is not primitive recursive.

AttributesValues
rdfs:label
  • Sudan function
rdfs:comment
  • Sudan function is a fast growing function discovered by Gabriel Sudan. It is similar to the Ackermann function (but less well-known) and formally defined as follows: \(F_0(x,y) = x+y\) \(F_{n+1}(x,0) = x\) (for \(n \geq 0\)) \(F_{n+1}(x,y+1) = F_n(F_{n+1}(x,y),F_{n+1}(x,y)+y+1)\) (for \(n \geq 0,y \geq 0\)) It has been proven that the function is not primitive recursive.
sameAs
dcterms:subject
dbkwik:googology/p...iPageUsesTemplate
abstract
  • Sudan function is a fast growing function discovered by Gabriel Sudan. It is similar to the Ackermann function (but less well-known) and formally defined as follows: \(F_0(x,y) = x+y\) \(F_{n+1}(x,0) = x\) (for \(n \geq 0\)) \(F_{n+1}(x,y+1) = F_n(F_{n+1}(x,y),F_{n+1}(x,y)+y+1)\) (for \(n \geq 0,y \geq 0\)) It has been proven that the function is not primitive recursive.
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