The Entropic Potential of Events in Deterministic and Indeterministic Systems
Bibliographic record
Abstract
This article analyses entropy changes triggered by specific events in deterministic and indeterministic systems. Article considers a simple model consisting of water in a cuvette, an ice cube in the device above the cuvette and a random number generator (RNG) that controls the probability of dropping the ice into water. Article introduces the entropic potential Z(T, A) of an event A occurred in a system R at the moment Т0, which describes the influence of the event A to the entropy of the system R in the future (for the moments T>Т0). The entropic potential of an event Z(T,A) can be calculated as the difference between the mathematical expectations of entropy of the system R for the moment T (T>Т0) made immediately before and immediately after the event A as Z(T, A) = ŜT(Т0+dT) - ŜT(Т0-dT). Article also presents examples of calculations of the entropic potentials of events in indeterministic systems with different probabilities of events. Since real-life systems are mostly indeterministic, the entropic potentials of events in real-life usually have non-zero values. The entropic potentials of the events "useful" for the system are negative, and entropic potentials of the events "harmful" for the system are positive.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".