The article presents an interesting definition for spaghettI. However by using the current known best in each BB class doesn’t really offer a robust analysis in

The article presents an interesting definition for spaghettI. However by using the current known best in each BB class doesn’t really offer a robust analysis in each class. I think it would be pretty interesting to see how much spaghetti it’s possible to make with a 6 states and then examine some of those BB machines vs reducible ones. Given the very large number of BB(6) programs that exist it’s quite possible that spaghetti ones haven’t really been looked at that much. Per the author there is only so much spaghetti that’s even possible with less instructions/states.