is scratch turing complete? meaning can scratch do whatever a modern operating system can do with enough blocks (even simulate itself) and run into the halting problem (i think yes because i nearly encounted it in my game because it got to complicated and the brodcasts got a bit messed up)

yes, if you remove the memory limits, but it will be LAGGUS MAXIMUS

Someone advanced should use the turing formula to see if it actually is, I don't think someone can just give out an answer.

ScratchCat3141 wrote:

(i think yes because i nearly encounted it in my game because it got to complicated and the brodcasts got a bit messed up)

Ha, share a link to the project so we can see if it actually did.

Scratch doesn't have to be able to do everything a modern operating system can do in order to be turing complete. A modern operating system has direct access to hardware components, like the speaker, which Scratch doesn't have. Just because Scratch can't synthesis and play any noise doesn't mean it isn't turing complete.

Scratch is turing complete, if you ignore the lack of infinite memory (which is generally done when considering turing completeness). You can make something turing complete with just a simple set of instructions (eg. if this and not that, goto broadcast1). Scratch has a lot of complicated instructions which put together definitely make it turing complete.

you may use the loudness block and maybe a smart use of operators can detect frequency