No label defined (Q3345811)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3880145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3880145 |
Statements
1984
0 references
verification condition generator
0 references
heuristics
0 references
uniqueness of prime factorizations
0 references
Fermat's theorem
0 references
recursive unsolvability of the halting problem
0 references
0.8136193752288818
0 references
0.7903197407722473
0 references
0.7889760136604309
0 references
[For the entire collection see Zbl 0545.00023.] This article consists of three parts: A tutorial introduction to a computer program that proves theorems by induction; a brief description of recent applications of that theorem-prover; and a discussion of several nontechnical aspects of the problem of building automatic theorem-provers. The theorem-prover described has proved theorems such as the uniqueness of prime factorizations, Fermat's theorem, and the recursive unsolvability of the halting problem.
0 references