4 ms·

For traversing a DAG you probably still would to avoid exploring an exponential number of paths (consider a chain of diamonds [1]). 1: https://www.researchgate

• zemnmez 6y ago
  It’s a lot easier to just have a depth limit on such non-cyclic graphs than keep an in-memory list of previously seen nodes. its interesting for sure! but a much rarer edge-case imo
• tyrust 6y ago
  But a diamond cannot occur in a Twitter-reply graph, right? It would require a Tweet to be able to reply to more than one tweet.
  • anonytrary 6y ago
    It can because the assumption is that we are crawling embedded links as well as native parents.
  • delecti 6y ago
    You can reply to one tweet while quote-retweeting another. Depending on how links are defined that could result in a diamond.
• smt1 6y ago
  of course, it depends on 'what' you are perceiving the computation of and if you were trying to stabilize the effects other surrounding (this would be like a pfaffian), just create a equivariant gauge relative to whatever your senses, just pretend to be like a "solenoid". knowing about a renormalization procedure to a set of pre-known "cardinals", like the lithium-defn (adiabatic "approximation") of seconds or unicode, knowing how they cross convolve or cross correlate. Almost all of these is pretty easy to directly infer or calculate in the discrete digital logical world (or reduce it to a branch and cut problem or SAT), but there seem to be limits to MOSfet technology.