• MinekPo1 [She/Her]
    link
    fedilink
    arrow-up
    2
    ·
    edit-2
    8 months ago

    I’m pretty sure you can create a Turing complete machine with an infinite amount of abacuses

    actual CS

    well its technically true , its not the abacusses which make it Turing complete see also xkcd 505