We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Vines
This should be a BSM as the tape and the seeds in total can store only bounded values (2n hexits to be exact, x is program size) but I'm very unsure so I haven't changed it Cleverxia (talk) 03:35, 19 August 2026 (UTC)
- BSM as in binary state machine? that link points to an esolang —aadenboy (talk|contribs) 03:46, 19 August 2026 (UTC)
- Hm, that would make a lot of sense! I know I haven't looked much into computational models so I don't really know where to put the language myself... Also, sorry, which part of the infobox should I even put it in? Is it "typesys"? --✿❁❃aeropurple||φb❃❁✿ ❦contribs❦ 06:06, 29 August 2026 (UTC)
- oh wait, I forgot that the language has built in infinite loop detection, so the language is Total. You should put it into the "class" section. Cleverxia (talk) 14:26, 10 September 2026 (UTC)
- Perhaps it is a weird turing-complete version of Total? I don't know... I'm not very good at categorizing things I guess lol --✿❁❃aeropurple||φb❃❁✿ ❦contribs❦ 16:30, 14 September 2026 (UTC)
- "D.O.T. is total because it don't have ANY way of looping/jumping. Adding a "while" command may make it Turing-complete."
- Well, Vines has looping in a way, so I kind of doubt it belongs in the Total category, to be honest... --✿❁❃aeropurple||φb❃❁✿ ❦contribs❦ 16:39, 14 September 2026 (UTC)
- totality and turing completeness are an oxymoron, or smth --dragoneater67 talk contribs 16:40, 14 September 2026 (UTC)
- something which is Total by definition cannot be Turing-complete; Total languages guarantee halting —aadenboy (talk|contribs) 16:40, 14 September 2026 (UTC)
- Yeah, that's what I thought, especially considering Vines never halts, unless you prevent it from doing anything on each loop --✿❁❃aeropurple||φb❃❁✿ ❦contribs❦ 17:41, 14 September 2026 (UTC)
- Perhaps it is a weird turing-complete version of Total? I don't know... I'm not very good at categorizing things I guess lol --✿❁❃aeropurple||φb❃❁✿ ❦contribs❦ 16:30, 14 September 2026 (UTC)
- oh wait, I forgot that the language has built in infinite loop detection, so the language is Total. You should put it into the "class" section. Cleverxia (talk) 14:26, 10 September 2026 (UTC)
a small note
even if the memory plane is infinite this language still isn't TC because the number of cells it can visit is bounded by twice the sum of b and d buds, making the plane's size essentially finite. making the memory plane infinite and making the seeds remember their memory plane positions through loops may work though... Cleverxia (talk) 08:11, 29 September 2026 (UTC)