Basic Difference Between Brain and Computer: Integration of Asynchronous Processes Implemented as Hardware Model of the Retina
Bibliographic record
Abstract
There exists a common view that the brain acts like a Turing machine: The machine reads information from an infinite tape (sensory data) and, on the basis of the machine's state and information from the tape, an action (decision) is made. The main problem with this model lies in how to synchronize a large number of tapes in an adaptive way so that the machine is able to accomplish tasks such as object classification. We propose that such mechanisms exist already in the eye. A popular view is that the retina, typically associated with high gain and adaptation for light processing, is actually performing local preprocessing by means of its center-surround receptive field. We would like to show another property of the retina: The ability to integrate many independent processes. We believe that this integration is implemented by synchronization of neuronal oscillations. In this paper, we present a model of the retina consisting of a series of coupled oscillators which can synchronize on several scales. Synchronization is an analog process which is converted into a digital spike train in the output of the retina. We have developed a hardware implementation of this model, which enables us to carry out rapid simulation of multineuron oscillatory dynamics. We show that the properties of the spike trains in our model are similar to those found in vivo in the cat retina.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".