User:IssaRice/Computability and logic/K (set of natural numbers)

From Machinelearning
Revision as of 23:28, 1 January 2019 by IssaRice (talk | contribs) (Created page with "In computability theory, the set <math>K</math> is defined as <math>K := \{x : x \in W_x\}</math>, where <math>W_0, W_1, \ldots</math> is a standard numbering of recursively e...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In computability theory, the set is defined as , where is a standard numbering of recursively enumerable sets.

Definition

Notation

This set is traditionally denoted . I'm not sure where this comes from.

Properties