Slime Mould Nanotechnology

Mayne, Richard; Adamatzky, Andrew

doi:10.1007/978-3-319-26662-6_7

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantum systems, another type of unconventional computing that relies on quantum mechanical processes, can be modelled and simulated using decision trees [55]. There are many advantages to adopting decision trees, including low power consumption, high speed, and parallelism [56], and the fact that they can be implemented using unconventional technology like spintronics and optoelectronics. As a result, decision trees are an effective and flexible resource for novel uses of computing.…”

Section: Capacitance and Impedance Measurements Of Proteinoids Protei...mentioning

confidence: 99%

Electrical spiking activity of proteinoids-ZnO colloids

Mougkogiannis,

Raeisi Kheirabadi,

Chiolerio

et al. 2024

Neuromorph. Comput. Eng.

View full text Add to dashboard Cite

We are studying the remarkable electrical properties of Proteinoids-ZnO microspheres with the aim of exploring their potential for a new form of computing. Our research has revealed that these microspheres exhibit behavior similar to neurons, generating electrical spikes that resemble action potentials. Through our investigations, we have studied the underlying mechanism behind this electrical activity and proposed that the spikes arise from oscillations between the degradation and reorganization of proteinoid molecules on the surface of ZnO. These findings offer valuable insights into the potential use of Proteinoids-ZnO colloids in unconventional computing and the development of novel neuromorphic liquid circuits. 

show abstract

Section: Capacitance and Impedance Measurements Of Proteinoids Protei...mentioning

confidence: 99%

Electrical spiking activity of proteinoids-ZnO colloids

Mougkogiannis,

Raeisi Kheirabadi,

Chiolerio

et al. 2024

Neuromorph. Comput. Eng.

View full text Add to dashboard Cite

show abstract

“…The majority of previous works on models for PM have been inspired by physical systems or biological colonies [31], [34]. Among them perhaps the most promising (in terms of quality of the abstraction, as well documented in the literature [13], [20]) is the so-called geometric Amoebot model [19], which is inspired by the behavior of the amoeba.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction

et al. 2020

View full text Add to dashboard Cite

We study models and algorithms for Programmable Matter (PM), that is matter with the ability to change its physical properties (e.g., shape or optical properties) in a programmable fashion. PM can be implemented by assembling a system of weak self-organizing computational elements, called particles, that can be programmed via distributed algorithms to collectively achieve some global task. Recent advances in the production of nanotechnologies have rendered such systems increasingly possible in practice, thus triggering research interests from many areas of computer science. The most established models for PM assume that particles: are modeled as finite state automata; are all identical, executing the same algorithm based on local observation of the surroundings; live and operate in the cells of a hexagonal grid; can move from one cell to another by repeatedly alternating between a contracted state (a particle occupies one cell) and an expanded state (a particle occupies two neighboring cells). Given these elementary features, it is rather hard to design distributed algorithms even for basic tasks and, in fact, all existing solutions to solve fundamental problems via PM have resorted to endowing PM systems with various capabilities to overcome such hardness, thus assuming quite unrealistic features. In this paper, we move toward more realistic computational models for PM. Specifically, we first introduce SILBOT, a new modeling approach that relaxes several assumptions used in previous ones. Second, we present a distributed algorithm to solve, in the SILBOT model, a foundational primitive for PM, namely Leader Election. This algorithm works in O(n) rounds for all initial configurations of n particles that are both connected (i.e. particles induce a connected graph) and compact (i.e. without holes, that is no empty cells surrounded by particles occur). As usual in asynchronous contexts, a round is intended as the time within which all particles have been activated at least once. Third, we show that, if the initial configuration admits holes, it is impossible to achieve leader election while preserving connectivity. Finally, by slightly empowering the robots, we design an algorithm to handle initial configurations admitting holes that in O(n 2 ) rounds solves the leader election problem while obtaining also compaction.

show abstract

Slime Mould Nanotechnology

Cited by 2 publications

References 19 publications

Electrical spiking activity of proteinoids-ZnO colloids

Electrical spiking activity of proteinoids-ZnO colloids

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction

Contact Info

Product

Resources

About