European Association for Theoretical Computer Science

@eatcs.bsky.social

70 Followers 10 Following

The aim of the EATCS is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science. #CSTheory

POV: you are reading on your ereader, sitting under the shade of a tree on a striped picnic blanket whose colors bear a suspicious similarity to the lesbian flag. There is a warm breeze that makes it comfortable to be outside, and because you have an ereader the wind doesn't perturb your pages. You are reading the 2026 Summer issue of the EATCS Bulletin and life is good

Picture i found on pixabay with the search term 'summer reading'. Thank you Perfecto_Capucine

Picture of text. "somewhere in their computer science degree program. We identified the following trends:
1. Almost all responding institutions include proof techniques as part of
their CS curricula. We asked survey respondents about only one topic that did not fall under the heading of automata, computability, or complexity:
techniques for writing mathematical proofs. Proof techniques are a required part of the computer science degree program for about 90 % of respondents, and most of the remaining respondents specified that this skill was covered in a regularly offered elective course. This seems to illustrate a strong shared commitment to proof-writing among our sample. (Note that if proof techniques were part of a discrete mathematics class required for computer scientists, this would still be counted using our methodology.)
2. Almost all responding institutions cover at least one topic in automata theory, computability, and complexity. Approximately 90 % of institutions reported that they covered at least one ToC topic in automata theory in at least one course in their computer science curriculum. The same was true for computability and for complexity theory (each considered independently).
3. Automata theory topic coverage. Most responding institutions cover regular languages and (non-)deterministic finite automata in their computer science curriculum. Fewer, about half, cover context-free grammars and pushdown automata, and a minority cover other topics including other automata and language classes.
4. Computability and complexity theory topic coverage. Coverage of ToC topics in computability theory and complexity theory was somewhat less consistent than the core topics in automata theory. Most respondents reported covering Turing machines and basic computability and complexity-theoretic"

Screenshot of first page, showing the Title "Foundations of Runtime Monitoring through the Lens of Concurrency Theory", the first few authors (Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Leo Exibard and Adrian Francalanza from respectively Italy, Iceland, Denmark, Malta, Franca and Malta), and the pdf viewer's page count 2/42

Don Knuth plays the organ. Photo credit Rajan P. Parrikar