Talk:Larch Prover

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Computing Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.

Inaccurate description of theorem provers

Latest comment: 2 years ago1 comment1 person in discussion

"Unlike most theorem provers, which attempt to find proofs automatically"

All provers in LCF tradition (Coq, Isabelle, HOL4, HOL Light) are "manual" and even "automatic" like ACL2 needs intermediate lemmas to "fill the dots". Push button theorem proving is mostly unattainable ideal far removed from reality, ignoring all kinds of fundamental limitations (Gödel's incompleteness etc). Or you can say: provers like ACL2 can attempt to find proof automatically, but that quickly fails for anything more complicated (realistic). So, Larch is very typical in it's need for manual intervention. 94.189.137.73 (talk) 08:09, 17 July 2024 (UTC)Reply

This page was redesigned at the edge.

A page that knows where it met you.

Talk:Larch Prover

Inaccurate description of theorem provers