Official operation-cost tables for sequence and map implementations. The mutable sequence table identifies constant indexed access and amortized constant append for dynamic arrays; the explanation distinguishes constant, effectively constant, amortized constant, logarithmic and linear bounds.
Primary source. Published 1986. Relevant locator: Abstract; pp. 533–536, hidden representations and gradient-based error correction.
Primary source. Published 2016. Relevant locator: Results, Figure 1 and Figure 2; Discussion: random feedback, learning performance and biological limitations.
Primary source. Published 1988. Relevant locator: Abstract and sections 2–3; Machine Learning 3, pp. 9–44: successive predictions and temporal credit assignment.
Source. Published 1976. Relevant locator: Communications of the ACM 19, pp. 113–126, physical symbol systems and search. Evidence type: original theoretical framework.
Source. Published 2015. Relevant locator: Abstract; Science 350, pp. 1332–1338: one-shot handwritten-character learning and generative tests.
Source. Published 1990. Relevant locator: Abstract; Cognitive Science 14, pp. 179–211, recurrent context, temporal XOR and sequence-learning simulations.
Chapter of Algorithms by Jeff Erickson, by Jeff Erickson. The first edition is dated June 2019.
Relevant locator: Chapter 3, §3.8 Subset Sum: include/exclude recurrence and memoization.
Chapter of Algorithms by Jeff Erickson, by Jeff Erickson. The first edition is dated June 2019.
Relevant locator: Chapter 6, §6.1 preorder/postorder and edge classification; §§6.5–6.6 strong components and linear-time decomposition.
Primary conference paper. Section 3.1 and Appendix A derive the general gradient identity; Section 4 treats baselines. The construction combines random-choice probabilities and differentiable deterministic paths in a stochastic computation graph.
Printed section 4.1, especially pp. 97–100, discusses greedy best-first search, A-star search, admissible heuristics and the finite-branching factor/positive-cost completeness conditions. The printed chapter identity is used without inferring an edition from its host directory.
Published in Proceedings of ECAI 1992, pp. 359–363. The paper introduced the SATPlan approach. The bounded model, state-transition formulas and deletion-sensitive proof used here are given explicitly rather than relying on a copied encoding.
Historical official synopsis identifying the Ewoks text-editor case study and topics including commands as software objects and dynamic binding. It is evidence for that earlier course, not an exact copy of a 2021 practical project.
Relevant locator: Scala standard library 2.13.6: Iterator abstract members hasNext and next, exhaustion, mutation and safe reuse.
Relevant locator: Official library README, About Scala-swing: Publisher/Reactor, listenTo, reactions; archived Reactor API at www.scala-lang.org/api/2.12.7/scala-swing/scala/swing/Reactor.html corroborates listenTo, deafTo and reactions. These corroborate the supplied source contract, not a verified 2021 course dependency version.
Relevant locator: What is TDD?: interleaved coding, unit tests and refactoring, and the short test/implementation cycle.
Relevant locator: isFinite(double), parseDouble(String) and toString(double): finite-number validation and numeric text helpers.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact