claim
active
claim:the-elephant-programmer-in-verifying-his-program-need-not-show-that-the-promise-will-be-fulfilled-because-it-was-made-it-is-enough-that-he-show-it-will-be-fulfilledThe Elephant programmer in verifying his program need not show that the promise will be fulfilled because it was made. It is enough that he show it will be fulfilled.
Rejection of one of Dorschel's conditions for happy performance.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Fifth abstract claim.
- Fourth abstract claim.
- Elephant source programs may not need data structures, because they can refer directly to the past.claim0.806Third abstract claim.
- Claim about the nature of accomplishment verification.
- McCarthy's position against Searle: computers can genuinely promise without requiring Searle's conditions (e.g., belief that fulfillment benefits recipient).
- Trade-off between internal and public obligations.
- Importation of Austin's idea to programs.
- Sixth abstract claim.