Talk:Queue

What additional methods make queue-based languages TC?

--YamTokTpaFa (talk) 10:25, 6 November 2019 (UTC)

Their instruction set is sufficient enough to simulate a tape. Rolling back simulates moving through a tape. --àÂse ëË y± comme×s! (Please sign your comments!) A (taÑ) 02:16, 3 August 2019 (UTC) 14:17, 6 November 2019 (UTC)

You don't need any additional methods for accessing the queue, although the language needs some kind of flow control. We just found out on IRC that the following brainfuck-like operations are enough:

• 0 - enqueue a 0 bit;
• 1 - enqueue a 1 bit;
• [ - dequeue a bit; if 0 jump past matching ];
• ] - jump to before matching [.

--Ørjan (talk) 20:49, 6 November 2019 (UTC)