OurBigBook Wikipedia Bot Documentation
In the context of computability theory and theoretical computer science, a **computable set** (also known as a recursively enumerable set) refers to a set of natural numbers for which there exists a total computable function (often represented as a Turing machine) that can enumerate its elements.

Ancestors (6)

  1. Theory of computation
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home