today's talk of Matthew Cook:
14 views
Skip to first unread message
Alexander Shen
Apr 7, 2025, 4:00:16 PMApr 7
to Kolmogorov seminar on complexity
https://youtu.be/QGlWCQXBDHQ
Imagine that we look at some examples of addition of two binary numbers
through small window (that includes three neighbor bit triples for two
numbers and their sum). Two neighbor windows should be consistent, and
we can draw a graph that shows the consistency requirements. Then this
graph can be simplified using some natural rules, and finally we get a
simple algorithm for binary addition (zig-zag: right -- left -- right
passes)
Imagine that we look at some examples of addition of two binary numbers
through small window (that includes three neighbor bit triples for two
numbers and their sum). Two neighbor windows should be consistent, and
we can draw a graph that shows the consistency requirements. Then this
graph can be simplified using some natural rules, and finally we get a
simple algorithm for binary addition (zig-zag: right -- left -- right
passes)
Reply all
Reply to author
Forward
0 new messages