Friedberg numbering
id:
friedberg-numbering-286-5984633
title:
Friedberg numbering
text:
In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all uniformly recursively enumerable sets that has no repetitions: each recursively enumerable set appears exactly once in the enumeration. The existence of such numberings was established by Richard M. Friedberg in 1958.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Friedberg_numbering
date created:
date modified:
2024-01-08T12:25:52Z
main entity:
{"identifier":"Q5503646","url":"https://www.wikidata.org/entity/Q5503646"}
image:
fields total:
13
integrity:
13