Definitions by lpzrrt

r.e.

Commonly, it is to use for defining to Recursive Enumerable language in computational complexity.

A property "P" is a non-trivial property of r.e. languages, if there is at least one r.e. language L satisfying P, and another L′ not satisfying P.

r.e. by lpzrrt June 13, 2018