| 
|
QuoteRef: rabiMO8_1974
topics >
all references >
ThesaHelp:
references p-r
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. 615-619. Google
616 ;;Quote: there are always short true statements concerning the addition of natural numbers whose formal proof is super-exponentially long
615 ;;Quote: proofs with a general purpose theorem prover may almost always be impractically long
618 ;;Quote: with NP-complete problems, one knows how to solve the problem but does not have enough time
ThesaHelp: references p-r (245 items)
Topic: theorem proving systems (20 items)
Topic: program proving is infeasible (46 items)
Topic: algorithmic complexity analysis (10 items)