1.This algorithm can be used to solve problems that are recursively-enumerable sets.
这个算法可以用来解决可递归枚举集的问题。
2. The set of all prime numbers is a recursively-enumerable set.
所有质数的集合是一个可递归枚举集。
3. The problem of finding the longest common subsequence in two strings is NP-complete, but we can use dynamic programming to solve it for recursively-enumerable sets.