| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910983058903321 |
|
|
Autore |
Formenti Enrico |
|
|
Titolo |
Machines, Computations, and Universality : 10th International Conference, MCU 2024, Nice, France, June 5–7, 2024, Revised Selected Papers / / edited by Enrico Formenti, Jérôme Durand-Lose |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2025.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (323 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 15270 |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Artificial intelligence |
Software engineering |
Computer engineering |
Computer networks |
Design and Analysis of Algorithms |
Artificial Intelligence |
Software Engineering |
Computer Engineering and Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
-- Complexity of infinite words. -- Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms. -- On Switching Finite State Automata. -- Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks. -- Universality of Turing Tumble of Finite Size. -- On the Power of Small Watson-Crick Automata and Variants of String Assembling Systems. -- From Petri Nets to Virus Machines. -- On the Powers of the Collatz Function. -- On the Entanglement and Mixedness of Quantum Boolean Function Circuits. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 10th International Conference on Machines, Computations, and Universality, MCU 2024, held in Nice, France, during June 5–7, 2024. The 8 full |
|
|
|
|
|
|
|
|
|
|
papers and 1 invited paper in this book were carefully reviewed and selected from 14 submissions. The scope of the conference topics includes, but is not limited to, computation in the setting of various discrete models Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models, analog and hybrid models, BSS machines, infinite time cellular automata, real machines, quantum computing, and the meaning and implantation of universality in these contexts. . |
|
|
|
|
|
| |