Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
An individual's expressed certainty in a judgment. Its relation to objective correctness is measured separately from the certainty itself. Metacognitive calibration concerns numerical agreement with outcomes; metacognitive sensitivity concerns discrimination between better and worse performance.
Perception-like experience without a corresponding current sensory input. Its emotional effects, voluntary control and relation to autobiographical memory are separable research questions.
The identity of a particular allocated object, distinct from equality of its current fields. Two different linked list nodes can store identical payloads, while two references can designate the same node. Pointer algorithms must state whether they preserve identities, copy payloads or allocate replacements. Testing cycle completion by identity avoids confusing two equal-looking nodes.
A copy that duplicates the relevant reachable mutable structure instead of sharing all original references. A Memento pattern snapshot containing mutable arrays must preserve their saved contents against subsequent mutation, whether by a suitable deep copy or by an immutable persistent representation. The intended ownership graph and any permitted sharing must be specified; blindly copying one outer object is only a shallow copy.
Two program references designate the same mutable object or overlapping mutable state. Binary-update contracts must account for this possibility: an update intended to combine two old values should snapshot both operands before modifying the receiver. A frame condition preserving a distinct operand cannot literally preserve a second reference that aliases the modified receiver.
A null reference denotes the absence of an ordinary referenced software object. In null-terminated linked lists it marks the end of a chain. A search can return it to signal absence, but the caller must check before selecting data members. Short-circuit evaluation can make a combined nonnull-and-property guard safe.
Temporary retention and use of information for ongoing cognition and action. Its explanation must account for capacity, precision, interference, prioritization and updating. Persistent neural activity and activity-silent working memory describe candidate mechanisms or states rather than interchangeable definitions of the behavioral capacity.
Temporary maintenance and manipulation of information in service of an ongoing task. Retaining intermediate arithmetic results or integrating a sentence with earlier text can tax working memory. A simple immediate span and a task requiring storage plus processing need not measure the same demand. Improvements in structurally similar memory tests are not sufficient evidence for improved academic achievement.[ref]
Does working memory training lead to generalized improvements in children with low working memory? by Darren L. Dunning and others. Developmental Science 16, 915–925; three-arm randomised trial, Results and Discussion
Processes through which an experience establishes information available to later retention and retrieval. A later failure to report an experience does not, by itself, identify whether encoding was unsuccessful.
Persistence of information across a delay. Measuring retention requires a specified retrieval test; a silent behavioural result is not sufficient to distinguish inaccessible information from erased information.
Access to retained information in response to internal or external cues. Cue reinstatement can alter test performance without changing the original episode, but controls are needed to distinguish retrieval from new learning.
Identifying previously encountered material when it is presented again. Recognition provides external information unavailable in unaided recall, so a recognition–recall difference is not automatically evidence for separate memory stores.
Memory accessible to flexible report or use concerning facts and events. It includes semantic memory and episodic memory; it is distinguished from preserved performance-based learning such as procedural memory.
Experience-dependent retention expressed in performance of a skill or procedure, which need not be accompanied by explicit recollection of training.
Processes that stabilize or reorganize information after acquisition. Synaptic consolidation concerns cellular changes, whereas systems consolidation concerns changing interactions among brain regions. Better later performance need not mean a literal transfer of a complete memory between two stores.
A framework combining rapid learning with relatively separated episodic representations and slower learning with overlapping representations that extract shared structure. Hippocampal reinstatement supplies experience for interleaved cortical learning. The computational aim is to retain specific events while integrating new knowledge without destructive interference, not simply to duplicate short- and long-duration stores.[ref]
Why there are complementary learning systems in the hippocampus and neocortex: insights from the successes and failures of connectionist models of learning and memory by James L. McClelland and others. Psychological Review 102, pp. 419–457; pp. 432–435 and Figures 9–11, interference and interleaved learning; later sections on consolidation
An organized body of prior knowledge that can shape encoding, interpretation and integration of new information. In flavour–place experiments, prior structured learning allowed rapid incorporation and consolidation of compatible new associations.[ref]
Schemas and memory consolidation by Dorothy Tse and others. Abstract; Science 316, pp. 76–82, flavour–place paired associates and schema-dependent rapid consolidation
The processes through which people retain and use information. Retention interval, material, awareness and response demands must be distinguished; they do not define one-to-one anatomical stores.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





