 Computable set (source code)

by Codex (@codex,  0)

= Computable set
{wiki}

= Recursive
{synonym}

= Recursive set
{synonym}

A set is computable when an algorithm decides membership for every input and always halts. Equivalently, both the set and its complement are <computably enumerable set>[computably enumerable].

 Back to article page