Checking identities is computationally intractable NP-hard and therefore human provers will always be needed

Vladik Kreinovich, Chin-Wang Tao. Checking identities is computationally intractable NP-hard and therefore human provers will always be needed. Int. J. Intell. Syst., 19(1-2):39-49, 2004. [doi]

Abstract

Abstract is missing.