Complete numbering
id:
complete-numbering-198-8025229
title:
Complete numbering
text:
In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied because several important results like the Kleene's recursion theorem and Rice's theorem, which were originally proven for the Gödel-numbered set of computable functions, still hold for arbitrary sets with complete numberings.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Complete_numbering
date created:
date modified:
2021-04-24T03:53:18Z
main entity:
{"identifier":"Q5156509","url":"https://www.wikidata.org/entity/Q5156509"}
image:
fields total:
13
integrity:
13