recursively enumerable set
(Q676835)
a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
Language:
Current Data About
recursively enumerable set
other details
| aliases |
computably enumerable set c.e. set r.e. set semidecidable set partially decidable set listable set provable set Turing-recognizable set provable |
| description | a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory) |
External Links
| (P646) |
/m/01x0mg
|
| (P2812) |
RecursivelyEnumerableSet
|
| (P3827) |
recursively-enumerable-sets
|
| (P6366) |
52703633
|
| (P10283) |
C52703633
|