Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ackermann_coding> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Ackermann_coding abstract "In Set theory Ackermann coding (or Ackermann interpretation)is the encoding of finite sets as natural numbersas devised by Wilhelm Ackermann in his 1937 paper(The Consistency of General Set Theory).Each natural number encodes a finite set andeach finite set is represented by a natural number.This mapping uses the binary numeral system.If the number n encodes a finite set A and the ith binary digit of n is 1then the set encoded by i is element of A.The Ackermann coding is a primitive recursive function.".
- Ackermann_coding wikiPageID "31940708".
- Ackermann_coding wikiPageRevisionID "578833901".
- Ackermann_coding hasPhotoCollection Ackermann_coding.
- Ackermann_coding subject Category:Set_theory.
- Ackermann_coding comment "In Set theory Ackermann coding (or Ackermann interpretation)is the encoding of finite sets as natural numbersas devised by Wilhelm Ackermann in his 1937 paper(The Consistency of General Set Theory).Each natural number encodes a finite set andeach finite set is represented by a natural number.This mapping uses the binary numeral system.If the number n encodes a finite set A and the ith binary digit of n is 1then the set encoded by i is element of A.The Ackermann coding is a primitive recursive function.".
- Ackermann_coding label "Ackermann coding".
- Ackermann_coding sameAs m.0gvsm1p.
- Ackermann_coding sameAs Q4674252.
- Ackermann_coding sameAs Q4674252.
- Ackermann_coding wasDerivedFrom Ackermann_coding?oldid=578833901.
- Ackermann_coding isPrimaryTopicOf Ackermann_coding.