Universal arithmetic 2026-10-24
A historical description of general calculation, appearing in the title of Arithmetica universalis by Isaac Newton. It is not a guarantee that every law of ordinary numerical arithmetic applies to every algebraic structure.
Unreduced rational representation 2026-10-14
Consider an original abstract data type whose values are rational numbers. Store an ordered pair of integers, interpreted as a numerator and a denominator. Use exact, unbounded integer arithmetic in this model. The storage space, representation invariant and abstraction function areThe representation invariant does not require a positive denominator or a reduced fraction. Consequently , and are three different concrete states with the same abstract rational number . Similarly, and both represent zero. The abstraction function is a surjection: every rational number has an integer numerator and a nonzero integer denominator, so every abstract value has a representation.
Both and violate the representation invariant; neither has a value under this abstraction function. By contrast, is completely valid. Simplifying it to the reduced fraction may be a useful implementation choice, but is not a requirement of this representation. Strengthening the representation invariant to require a positive denominator and a greatest common divisor of one would choose a unique stored representative for each rational number; every constructor and operation would then need to establish that stronger condition.
Equality of abstract values is therefore different from equality of stored ordered pairs. For valid and ,This defines an equivalence relation on : each equivalence class contains all representations of one rational number. An API equality operation can compare these cross-products using exact integer arithmetic. Comparing the two fields individually would incorrectly declare and unequal as rational numbers. The general reason is that an abstraction function may map several concrete values to one abstract value.[ref]
8.3 Module Documentation. Section 8.3.1, Abstraction Functions: several concrete values mapping to one abstract value; Section 8.3.4, Representation Invariants: valid domain of AF
Valiant's permanent reduction Created 2026-09-28 Updated 2026-11-05
Valiant's permanent reduction encodes satisfying assignments as weighted cycle covers of a directed graph. The permanent of a matrix sums the products of edge weights over these cycle covers of a directed graph.
Variable tracks enforce consistent truth values, clause interchanges enforce satisfaction, and signed junctions cancel invalid boundary choices. The original construction giveswhere is twice the number of literal occurrences minus the number of clauses. Arithmetic recovers the predictable factor. The correspondence is between assignments and weighted groups of covers, rather than individual covers. Further transformations yield zero-one matrices.[ref]
Working memory 2026-10-24
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
