Design and fabrication of networks for bacterial computing
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Non-deterministic polynomial (NP-) complete problems, whose number of possible solutions grows exponentially with the number of variables, require by necessity massively parallel computation. Because sequential computers, such as solid state-based ones, can solve only small instances of these problems within a reasonable time frame, parallel computation using motile biological agents in nano- and micro-scale networks has been proposed as an alternative computational paradigm. Previous work demonstrated that protein molecular motors-driven cytoskeletal filaments are able to solve a small instance of an NP complete problem, i.e. the subset sum problem, embedded in a network. Autonomously moving bacteria are interesting alternatives to these motor driven filaments for solving such problems, because they are easier to operate with, and have the possible advantage of biological cell division. Before scaling up to large computational networks, bacterial motility behaviour in various geometrical structures has to be characterised, the stochastic traffic splitting in the junctions of computation devices has to be optimized, and the computational error rates have to be minimized. In this work, test structures and junctions have been designed, fabricated, tested, and optimized, leading to specific design rules and fabrication flowcharts, resulting in correctly functioning bio-computation networks.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it