The field of computational complexity and automata theory is witnessing significant developments, with a focus on unconditional lower bounds and innovative approaches to simulation and representation. Researchers are exploring new techniques to improve the efficiency of algorithms and understand the fundamental limits of computation. A key area of investigation is the intersection non-emptiness problem, with implications for the relationships between major complexity classes. Another direction of research involves the geometric and information-theoretic aspects of deterministic computation, revealing new insights into the nature of spacetime and the holographic principle. Furthermore, extensions of automata to infinite alphabets are being developed, enabling more expressive and powerful models of computation. Noteworthy papers include: On the Holographic Geometry of Deterministic Computation, which introduces a novel simulation technique with significant implications for our understanding of computational spacetime. Symbolic ω-automata with obligations is another notable contribution, proposing a new approach to automata design that subsumes classic families and recognizes a strict superset of ω-regular languages.