_{1},...,x

_{k}, f(x

_{1},...,x

_{k}) is a number between 0 and k that is not |{x

_{1},...,x

_{k}}∩A| then A is recursive. The same is not true for polynomial time but is open for regular languages. Details and some partial results in Tantau's paper.

## No comments:

## Post a Comment