开发者

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.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜