Hi Bill, On Fri, Jul 20, 2012 at 9:00 PM, Bill Richter <[email protected]> wrote: > I'm looking for some kind of upper bound on how astounding a result you > can prove with little work if we have no heuristics, e.g. no `limit on depth > of chaining.'
There is no established limit. There are just optimists, pessimists, and measures of progress. In some parts of math, systems like Waldmeister and Prover9 already produce fairly astounding results, like the proof of the Robbins conjecture (http://en.wikipedia.org/wiki/Robbins_algebra). See Stanovsky & Philips (ceur-ws.org/Vol-378/paper3.pdf) for recent overview of results in loop theory. A more representative collection of problems is the TPTP library (tptp.org). Performance of systems on such problems is annually measured in the CASC competition (tptp.org/CASC). It is also hard to define what "little work" means. A very small system like leanCoP (http://www.leancop.de/) can be surprisingly powerful on some problems. Best, Josef > > -- > Best, > Bill > > ------------------------------------------------------------------------------ > Live Security Virtual Conference > Exclusive live event will cover all the ways today's security and > threat landscape has changed and how IT managers can respond. Discussions > will include endpoint security, mobile security and the latest in malware > threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ > _______________________________________________ > hol-info mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/hol-info ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ hol-info mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/hol-info
