Computably enumerable set

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if:

Excerpt from the Wikipedia article “Computably enumerable set”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Jean-Christophe BENOIST, CC BY-SA 4.0, via Wikimedia Commons.