tag:blogger.com,1999:blog-2752058700154467226.post2900201228906380613..comments2024-03-09T10:23:37.496+00:00Comments on Bristol Cryptography Blog: On subleq machinesBogdanhttp://www.blogger.com/profile/13266116282208635140noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-2752058700154467226.post-85506861135376985132011-10-25T19:22:00.279+01:002011-10-25T19:22:00.279+01:00Yes, but neither David Naccache nor I claimed that...Yes, but neither David Naccache nor I claimed that subleq is the simplest machine possible. My perception of David's talk was that his goal isn't aiming at finding the simplest machine, but at finding a machine which is simple enough to fit it into theoretical frameworks, easily testable in an evaluation process and yet provides reasonable performance. Considering that it is work in progress, subleq seems to be the best trade off that David and his group have found so far.Simon Hoerderhttps://www.blogger.com/profile/10121312434981379262noreply@blogger.comtag:blogger.com,1999:blog-2752058700154467226.post-45913612580643376292011-10-05T03:27:50.745+01:002011-10-05T03:27:50.745+01:00Subleq is not the simplest OISC. There are bit man...Subleq is not the simplest OISC. There are bit manipulating machines, which are much simpler yet still universal and with comparable power as arithmetic based OISCs.mazonkahttps://www.blogger.com/profile/09621083083657692081noreply@blogger.com