Active Entries
- 1: "Narrow AGI" this year?
- 2: Tao on coordinate vs coordinate-free math reasoning
- 3: "Aging as a loss of goal-directedness"
- 4: New integrated mode for GPT-4 in ChatGPT+
- 5: Китайский новый год начнётся 10-го февраля
- 6: Automating the Search for Artificial Life with Foundation Models
- 7: "Anatomy of a Formal Proof"
- 8: C to safe Rust automatic translation using LLMs and dynamic analysis
- 9: GonzoML
- 10: Transformers as a Computational Model (workshop)
Style Credit
- Style: Neutral Good for Practicality by
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
Expand Cut Tags
No cut tags
no subject
Date: 2021-08-03 07:27 pm (UTC)which is presumably behind all modern implementation of persistent data structures in Clojure and other languages:
https://lampwww.epfl.ch/papers/idealhashtrees.pdf (also posted here https://hashingit.com/elements/research-resources/2001-ideal-hash-trees.pdf )
These ideal hash trees are more like Tries ("Hash Array Mapped Trie").
Array Mapped Tries(AMT), first described in "Fast and Space Efficient Trie Searches", Bagwell [2000], form the underlying data structure.