Join this 2-hour 15-minute Kolmogorov seminar on computational and descriptional complexity featuring Matthew Cook's talk. Explore a fascinating approach to binary addition where examples are viewed through a small window that includes three neighboring bit triples for two numbers and their sum. Learn how consistency requirements between neighboring windows can be represented as a graph, which when simplified using natural rules, reveals an elegant binary addition algorithm consisting of right-left-right zig-zag passes. This seminar continues the tradition established by Kolmogorov around 1979, examining fundamental concepts in computational complexity.