Talk:𝕆

this seems to be a FSA instead of a turing machine due to having a bounded tape --dragoneater67 [talk|contribs] 04:59, 29 October 2026 (UTC)

There are "Add cell" and "Remove cell" instructions, but it's not clear how the adding/removing is done. I'll wait for the Function column to be filled out. –PkmnQ (talk) 05:13, 29 October 2026 (UTC)

With circular tape (queue) and insertion and deletion of cells it reminds me BSQBL. Maybe, they can be translated to each other. --Blashyrkh (talk) 07:48, 29 October 2026 (UTC)

Or maybe not. In BSQBL each operation moves its operand to the most inconvenient position (which requires either careful planning or marked up memory layout). In 𝕆 the operand is still accessible for immediate further actions. --Blashyrkh (talk) 08:08, 29 October 2026 (UTC)

I'll fill it out soon, don't worry! It's 1:30 in the morning where I live though, so I'll probably do it tomorrow. Also, that FSA note is helpful, thanks! --Filbist (talk) 05:31, 29 October 2026 (UTC)

Filled in! Also, about BSQBL, I looked through that and it does indeed seem quite similar. Interesting! --Filbist (talk) 12:15, 29 October 2026 (UTC)

It is even more similar to Rouedeux --ChuckEsoteric08 (talk) 07:52, 30 October 2026 (UTC)

Suggestions for improvement

This page currently has a few issues regarding ambiguous phrasing, missing details, and underspecified semantics.

The tape can be visualized both as a vertical tape and as a wheel.

It's a bit strange for me since tapes are usually laid horizontally rather than vertically. Though this choice doesn't really matter. Also, since it's possible to insert/delete cells, is it really a tape? And since the "tape" loops, I think a circular linked-list fits better to describe the data model. Or you can also use a queue since the pointer only moves in one direction. This eliminates a lot of the ambiguities currently present in the page.

Flips the whole tape around the perceived center in the flat visualization.

In my opinion this "perceived center" is a bit underexplained. Since you mentioned that the pointer should stay in place while the tape shifts during forward movement, is the pointer the perceived center (imagine mirroring the wheel according to an axis that goes through the pointer)? Or is it the actual center of the tape like in your vertical tape visualization?

Checks if the current bit is 0, and if it is, runs the argument.

Like the BF '[', except has no base condition. By default, without a condition, it acts as a NOP, and if a condition is given but isn't met, it skips to the next instruction past the matching loop end.

It's not mentioned where we place the argument for r,t,f, and g. For y, it's not mentioned how to give a base condition to this instruction. The same also applies to u.

Other than that, I think this page will benefit a lot from a few examples. --SE (talk) 19:31, 30 October 2026 (UTC)