hode

ute their input can potentially convey more than a format that locks you into reading a single author. Alas, the potential for noise is higher too -- but still, this is why Wikipedia has been so wildly successful. One might ask, "We've already got Wikipedia; what possible improvement on that do you see?" The thing about Wikipedia is it presents what the author(s) consider(s) settled knowledge. It is a place for record, not a place for debate. A good shared knowledge base would by contrast also resemble Twitter -- but more organized, more navigable. In practice the personal knowledge bases I've seen look much more like silos. I once frolicked for an afternoon through Andy Matuschak's[4], which was quite enjoyable. But it was mostly about ... can you guess? ... how to build a knowledge base. If someone finds a scheme that scales, I believe it could be much more powerful than what we currently call AI. [1] https://github.com/JeffreyBenjaminBrown/hode [2] https://github.com/synchrony/smsn/ [3] https://twitter.com/brandontoner [4] https://notes.andymatuschak.org/Knowledge_work_should_accret...

elationship bewteen an "ask for" relationship and a "have" relationship. Once you've reified your relationships that way, you'd like to be able to search intelligently through them. "Ordinary" knowledge graphs let you see all of a thing's children, or parents, or maybe in some cases all it's descendents and ancestors up to some level of recursion. Better would be something that lets you ask targeted questions, like "Show me everything Sally has asked me to do that does not require a computer." To my knowledge there's only one program that lets you reify your data and query it in the ways I've described. It's called Hode, for Higher Order Data Editor. I wrote it. https://github.com/JeffreyBenjaminBrown/hode

ct a similar mechanic sits behind the (in this sense very ignorant) accusations of self-plagiarism against Slavoj Zizek. As such, one might wish to instead consider using Hypertext Fiction tools for creating a Zettelkasten, such these two (proprietary software, Mac OS X only, unfortunately): http://www.eastgate.com/Tinderbox/ http://www.eastgate.com/storyspace/ Note that there exists an EXTREMELY useful plugin for Tinderbox which implements Stretchtext: https://natematias.com/stretchtext/ Now gimme a combination of what roamresearch.com does with the above, but using the data structure of Hode: https://github.com/JeffreyBenjaminBrown/hode But with support for zzstructure like hyperthogonality: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/i... And secretly use the patching patches feature of pijul.org in the background so version control actually becomes sanely doable, throw in elastic tab stop support, and maybe an entire kitchensink in which someone let a mixture of ChrysaLisp, SmallTalk, Hazel, Scala 3, /r/nosyntax, Inferno, RINA, GNUnet, & every single proof assistant and theorem prover sit for a tad bit long, and then MAYBE we can stop living in the dark ages of computing. (Yes I'm bitter) P.S.: Identity Transclusion ≠ Instance Transclusion P.P.S.: Birth & Death of Javascript, anyone?

ists Hode lets you do even better than tags -- you can classify the meaning of the tag. For instance, here are two commands that would add two tags to a book: /add The Wisdom of Crowds #was a best-seller /add The Wisdom of Crowds #(helps understand) finance > Be tied to my highlights, annotations, and bookmarks in a non-proprietary, searchable, and shareable format Hode is free software, and the data format it uses is dirt-simple. Hode permits encoding and searching just about anything I can think of. Hode cannot yet create the data for you to search, though -- so far you've got to enter the data yourself. > Let me query this tool like a relational database. For example: show me all books about scaling startups recommended by people I follow on Twitter or by people they follow. /find (/eval /it #(is about) scaling startups) & (/eval (/eval I #follow /it #on Twitter) #recommends /it) > Help me deal with prioritization Hode lets you order your search results according to any transitive binary relationship -- "read before" or "is more important than" or "was written before", whatever you want. [1] https://github.com/JeffreyBenjaminBrown/hode

rguments seems likely to require true intelligence. I happen to have made a system[1] in which indexing any kind of data or metadata is extremely easy, requiring little more than knowing some natural language. (Deciding what kind of information you want to encode is hard, but once you've decided that, encoding it is easy.) [1] https://github.com/JeffreyBenjaminBrown/hode