BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Martin Kutrib (Universität Gießen) DTSTART:20250219T140000Z DTEND:20250219T150000Z DTSTAMP:20260423T021155Z UID:FLAT/7 DESCRIPTION:Title: Cel lular automata: Communication matters\nby Martin Kutrib (Universität Gießen) as part of One FLAT World Seminar\n\n\nAbstract\nWe consider syst ems of a huge number of interacting finite automata as massively parallel systems.\nThe finite automata (also called cells) are arranged as one-dime nsional array and work synchronously\nat discrete time steps. Naturally\, the communication between the cells is necessary for non-trivial computati ons\nand\, in fact\, the amount of communication matters. Here\, we focus mainly on measuring the amount of\ncommunication quantitatively by the num ber of messages sent by the cells. Recent results on the computational\nca pacity as well as on decidability problems in such restricted cellular aut omata are discussed. In particular\,\nfundamental types of communication a re considered and the questions of how much communication is\nnecessary to accomplish a certain task and of whether there are communication hierarch ies are addressed.\nSince even for systems with drastically bounded commun ication many properties are undecidable\, another\nquestion is to what ext ent the systems have to be limited in order to regain decidable properties .\nWe present some selected results on these topics and want to draw atten tion to the overall picture and\nto some of the main ideas involved.\n LOCATION:https://researchseminars.org/talk/FLAT/7/ END:VEVENT END:VCALENDAR