Papers › On morphological and functional complexity of proteinoid microspheres
On morphological and functional complexity of proteinoid microspheres
Saksham Sharma, Adnan Mahmud, Giuseppe Tarabella, Panagiotis Mougoyannis, Andrew Adamatzky
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Proteinoids are solidified gels made from poly(amino acids) based polymers that exhibit oscillatory electrical activity. It has been proposed that proteinoids are capable of performing analog computing as their electrical activity can be converted into a series of Boolean gates. The current article focuses on decrypting the morphological and functional complexity of the ensembles of proteinoid microspheres prepared in the laboratory. We identify two different protocols (one with and one without SEM) to prepare and visualize proteinoid microspheres. To quantify the complexity of proteinoid ensembles, we measure nine complexity metrics (to name a few: average degrees Degₐᵥ, maximum number of independent cycles u, average connections per node Connₐᵥ, resistance res_(eff), percolation threshold percₜ) which shine light on the morphological, functional complexity of the proteinoids, and the information transmission that happens across the undirected graph abstraction of the proteinoid microspheres ensembles. We identify the complexity metrics that can distinguish two different protocols of preparation and also the most dense, complex, and less power consuming proteinoid network among all tested. With this work, we hope to provide a complexity toolkit for hardware designers of analog computers to design their systems with the right set of complexity ingredients guided one-to-one by the protocol chosen at the first place. On a more fundamental note, this study also sets forth the need to treat gels, microspheres, and fluidic systems as fundamentally information-theoretic in nature, rather than continuum mechanical, a perspective emerging out from recent program by Tao to treat fluids as potentially Turing-complete and thus, programmable.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections