Is the Starbucks menu Turing Complete?
If we were to interpret the Starbuck's mini-language menu system as some sort of grammar or state machine, woul开发者_运维百科d that grammar be Turing complete? A description of the Starbuck's order mini-language can be found here
No. It's a finite language, and at a glance it looks regular.
精彩评论