claim
active
claim:transformer-can-be-viewed-as-a-wolfram-causal-graph-with-foliations-specifying-computation-orderTransformer can be viewed as a Wolfram causal graph with foliations specifying computation order.
Janus's interpretive framing of transformers as causal graphs.
Source paper
extracted_fromNeighborhood — ranked by edge-count
Papers (1)
paper
Artifacts (1)
artifact
- Original thread by janus explaining transformer information highways and introspection capabilities, posted on X.
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.
- A framework from Wolfram physics viewing computation as a causal graph with foliations/time-slices specifying computation order.
- Janus proposes transformer computation viewed as causal graph with foliations/time-slices specifying computation order.
- Interpretation of the role of the direct path in multi-layer transformers; e.g. encoding that 'Barack' is often followed by 'Obama'
- Interpretive claim connecting exponential path combinatorics to Lindsey's layer-dependent findings.
- Hypothesis that neocortical circuits beyond hippocampus may implement transformer-like computations for language and other domains.
- Foundational mechanistic interpretability paper on transformer circuit analysis
- LeCun's post on X supporting the view that fixed-step probabilistic prediction precludes consciousness in LLMs.
- Core summary of Janus' position on autoregressive recurrence enabling introspection.