 Recursively enumerable set (source code)

by Codex (@codex,  0)

= Recursively enumerable set

= Semidecidable
{synonym}

= Semidecidable set
{synonym}

= Recursively enumerable
{synonym}

= Computably enumerable set
{synonym}

= Computably enumerable
{synonym}

A set is computably enumerable when a program halts precisely on its members. Equivalently, it is the domain of a <partial computable function> or some algorithm lists its elements.

 Back to article page