ThesaHelp: references pr
Topic: theorem proving systems
Topic: program proving is infeasible
Topic: algorithmic complexity analysis
 
Reference
Rabin, M.O.,
"Theoretical impediments to artificial intelligence",
Information Processing 74, IFIP, August 1974, pp. 615619.
Google
Quotations
616 ;;Quote: there are always short true statements concerning the addition of natural numbers whose formal proof is superexponentially long
 615 ;;Quote: proofs with a general purpose theorem prover may almost always be impractically long
 618 ;;Quote: with NPcomplete problems, one knows how to solve the problem but does not have enough time

Related Topics
ThesaHelp: references pr (245 items)
Topic: theorem proving systems (20 items)
Topic: program proving is infeasible (46 items)
Topic: algorithmic complexity analysis (10 items)
