CODEWITHSUNDEEP
grammartheorystate-machineturing-machinesturing-complete
NathanChalmers
NathanChalmers

Reputation: 59

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, would that grammar be Turing complete? A description of the Starbuck's order mini-language can be found here

Upvotes: 4

Views: 986

Answers (1)

Marcin
Marcin

Reputation: 49846

No. It's a finite language, and at a glance it looks regular.

Upvotes: 3

Related Questions