| 
|
Quote: the Hilbert functional calculus can be modified so that an automatic machine will find all provable formulae
topics >
all references >
references t-z >
Topic:
mathematics as a formal system
Topic:
non-deterministic processing
Quotation Skeleton
If the notation of the Hilbert functional calculus … [ref] … number of symbols, it becomes possible to construct … [see footnote] machine \Kappa, which will find all the provable formulae of … [footnote: "The author has found a description of such a machine"] … [footnote] … is then easy to construct the required automatic … Each proof will then be determined by a … and hence the [binary number] completely determines the proof. … Google-1 Google-2
Copyright clearance needed for quotation.
Additional Titles
Quote: construct a choice machine by successively computing the result for each possible sequence of choices
Topic: mathematics as a formal system (30 items)
Topic: non-deterministic processing (19 items)