The Banach-Tarski Paradox Dictates Snyergistic Routes for Scale-Free Neurodynamics
Bibliographic record
Abstract
Neuroscientists are able to detect physical changes in information entropy in available neurodata. However, the information paradigm is inadequate to fully describe nervous dynamics and mental activities such as perception. This paper provides an effort to build explanations to neural dynamics alternative to thermodynamic and information accounts. We recall the Banach–Tarski paradox (BTP), which informally states that, when pieces of a ball are moved and rotated without changing their shape, a synergy between two balls of the same volume is achieved instead of the original one. We show how and why BTP might display this physical and biological synergy meaningfully, making it possible to tackle nervous activities. The anatomical and functional structure of the central nervous system’s nodes and edges allows to perform a sequence of moves inside the connectome that doubles the amount of available cortical oscillations. In particular, a BTP-based mechanism permits scale-invariant nervous oscillations to amplify and propagate towards far apart brain areas. Paraphrasing the BPT’s definition, we could state that: when a few components of a self-similar nervous oscillation are moved and rotated throughout the cortical connectome, two self-similar oscillations are achieved instead of the original one. Furthermore, based on topological structures, we illustrate how, counterintuitively, the amplification of scale-free oscillations does not require information transfer.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.006 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
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".