claim
active
claim:elephant-source-programs-may-not-need-data-structures-because-they-can-refer-directly-to-the-pastElephant source programs may not need data structures, because they can refer directly to the past.
Third abstract claim.
Neighborhood — ranked by edge-count
Papers (1)
paper
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.
- Rejection of one of Dorschel's conditions for happy performance.
- Fifth abstract claim.
- Fourth abstract claim.
- It seems likely that the simple cases will be most useful in the initial applications of Elephant 2000 and similar languages.hypothesis0.760Prediction about initial usage.
- McCarthy's position against Searle: computers can genuinely promise without requiring Searle's conditions (e.g., belief that fulfillment benefits recipient).
- Seventh abstract claim.
- Statement that the versus relation uniquely determines a tree.
- Radical assertion that function reduces to living structure, eliminating the need for external goals.