Computably enumerable
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:
* There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Or, equivalently,
* There is an algorithm that enumerates the members of S. That means that its output is simply a list of all the members of S: s1, s2, s3, ... . If S is infinite, this algorithm will run forever.
Admissible ruleAlbert MuchnikAlgorithmAlgorithmically random sequenceArithmetical hierarchyArithmetical setAutomated theorem provingBack-and-forth methodBorel hierarchyCEChain rule for Kolmogorov complexityChaitin's constantChurch–Turing thesisCo-r.e.Co-recursively enumerableCo-recursively enumerable setComplexity classComputability logicComputability theoryComputable functionComputable numberComputable setComputably enumerable setComputably inseparableConsistencyConstructivism (philosophy of mathematics)Context-sensitive grammarCountable setCraig's theoremCreative and productive setsDavid SeetapunDavis–Putnam algorithmDecidability (logic)Decision problemDiophantine equationDiophantine setDisjunction and existence propertiesDovetailing (computer science)Effective enumerationEmil Leon Post
Link from a Wikipage to another Wikipage
primaryTopic
Computably enumerable
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:
* There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Or, equivalently,
* There is an algorithm that enumerates the members of S. That means that its output is simply a list of all the members of S: s1, s2, s3, ... . If S is infinite, this algorithm will run forever.
has abstract
Als rekursiv aufzählbare Menge ...... fzählbare Mengen gemeint sein.
@de
En théorie de la calculabilité ...... ment énumérables est notée RE.
@fr
In computability theory, a set ...... s under inclusion is denoted .
@en
Na Teoria da computabilidade, ...... sobre inclusão é denominado .
@pt
Nella teoria della calcolabili ...... retto degli insiemi ricorsivi.
@it
Se denomina recursivamente enu ...... naturales que pertenecen a B:
@es
Перечисли́мое мно́жество (эффе ...... лимых подмножеств — несчётным.
@ru
طبقًا لنظرية الحوسبة، والمعروف ...... ون تحت الإدراج يُرمَز لها بـ .
@ar
帰納的可算集合（きのうてきかさんしゅうごう、英: Recur ...... 基づく r.e. 集合の束 (lattice) を と書く。
@ja
递归可枚举集合（英語：Recursively enumera ...... 么有时说半可判定的，而第二种情况说明了为什么叫计算可枚举的。
@zh
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,670,727
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Als rekursiv aufzählbare Menge ...... , die nicht entscheidbar sind.
@de
En théorie de la calculabilité ...... ment énumérables est notée RE.
@fr
In computability theory, a set ...... is algorithm will run forever.
@en
Na Teoria da computabilidade, ...... oritmo pode rodar para sempre.
@pt
Nella teoria della calcolabili ...... retto degli insiemi ricorsivi.
@it
Se denomina recursivamente enu ...... naturales que pertenecen a B:
@es
Перечисли́мое мно́жество (эффе ...... курсивно перечислимые — уровню
@ru
طبقًا لنظرية الحوسبة، والمعروف ...... لموجودة في S. أو، بشكلٍ مساوٍ،
@ar
帰納的可算集合（きのうてきかさんしゅうごう、英: Recur ...... 基づく r.e. 集合の束 (lattice) を と書く。
@ja
递归可枚举集合（英語：Recursively enumera ...... 么有时说半可判定的，而第二种情况说明了为什么叫计算可枚举的。
@zh
label
Computably enumerable
@en
Conjunto recursivamente enumerable
@es
Conjuntos recursivamente enumeráveis
@pt
Insieme ricorsivamente enumerabile
@it
Rekursiv aufzählbare Menge
@de
Récursivement énumérable
@fr
Перечислимое множество
@ru
مجموعة مرقمة بشكل تراجعي
@ar
帰納的可算集合
@ja
递归可枚举集合
@zh