There is a lot of work on combinational logic synthesis, but very little on sequential logic synthesis and even less work on minimum complexity sequential logic synthesis. This, despite the importance of Kolmogorov Complexity to scientific induction (aka, Solomonoff Induction).
So, to take the simple example of an f/2 circuit, I'm interested in what algorithms can, given this (Input, Output) sequence: (0,0) (1,0) (0,1) (1,1) ... repeating... synthesize anything like the top-left cyclic NOR logic <http://www.falstad.com/circuit/circuitjs.html?ctz=CQAgjCAMB0l3BWcMBMcUHYMGZIA4UA2ATmIxAUgoqoQFMBaMMAKABkQHD9OwU9OhBIV78o4gGYBDADYBnOtUgsAshW6iB3AUzFUU0BCzAJsnACzERundjznN4s0iMmzVkB7QCPVM7WNTTjwqBlwHbBROcKdxVyCmYiibYNC+AT84wPdrdJBvR0yAtxBsBGS880IHFMyXFgB3QR4UhktcvUbo+0dEis6mhhDHD1qugpSy-oyuqpq84TSB5p08rhawEWVB7V5cpL2oLr7Dk6Y+I8G7ebEwnoYC7e6agtHHrreeUbBzBye7m62HrMKL-a7gC4eEGXZ7RSA1cEPHhPCZ5CYocxUFEtDFpA4PTEws643j4n5-WbVRxzaKgykIqKjSIwpmM3IXJ6szwiYbY1ZiCZUvmCBybEUwsVcUUiXxdMUeBVbcZfERTbkwtUeNXnOlNZlheGlZLYQgzK73GJDUIxJ76k06drRU1Ex1hZ1tb6-InDVo+oXHP01V3+wbBoPfDnKnQkibmMXCtqSn1xpWDZNJ61ob1LHQ+sAYVOpXgF0rlYuF7X51Vlphe-55ktWzj8GYlFDCfKEtUk-TUeJmduqk2lqLYYe9gJ6ssk7sYXUj0rDtU2rrLw2D-JzjXTrcbldNDeYKKHjsojuRfTnw1nkTlAQbhCRg8d8zDDc021l1+X29PheP48X15VcywQL01QA7col+AQ1W-I42w7MCIlAut8iyRCRBghdsLqCgukglMKAuTEsQIi57WI0cyyeXZKMIuAYV2UiqNKZ1aJ4cxmWYxiONg4c6PY7JWK4qJmOZCd8JKSCxxEOjx3Q+op1HYdHVkqCQGwwjXxhd8qTAA4PzlQz9IOFAMSODhhnBHTwSxEBpHkRQkGUNR5JEDAy3U-RDC6YZFnyJCNE-FTq1HITnywxj3wk8YXx08yIh6G8F0S0pkvGCzwWsjKmgM48LMPCy+M07ieCEQtdgqkBhmqp5ao7fzgtmLVhxkrMUpY5chKAA> and then find its minimum complexity circuit that follows below-right: [image: f2dividers.png] ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Tb9b009413931e22d-M2843d0a03258e93f387985c4 Delivery options: https://agi.topicbox.com/groups/agi/subscription
