recursively enumerable language (Q1073063)
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
Language:
other details
aliases Turing-recognizable
description a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)

External Links