Turing Attributes (scoping type,and else..)

[Ratinho]

Hey guys, i have some question about Turing...
Does Turing support static scopes or dynamic scopes? I think that the scope is static, but I couldn't find any real evidence to its existance.
Also, is it Strongly Typed?

Does it have a Garbage Collector? If so, what algorithm does it use?
Is there any sort of concurrency (such as Threads)?
Are variable names tied to specific cells in the memory at compile time, or is it dynamically allocated?

Thank you so much. This is the only active community I found that has information on Turing.

[Insectoid]

Turing is statically scoped (I think, based on Wiki's definition), strongly typed and most likely hasn't got a garbage collector. It has support for processes which execute pseudo-simultaneously with the main program but are very unreliable and generally should be avoided. I dunno how Turing handles variable names.

[Tony]

The majority of variables in a typical Turing program live on a stack http://en.wikipedia.org/wiki/Stack-based_memory_allocation

That should answer the question.

[DemonWasp]

Turing's scoping is static.

Turing is strongly-typed, for most definitions of "strongly-typed". Turing does have an explicit mechanism for changing one type of variable to another (strint, intstr, etc), but does not allow intermixing of types.

Turing has no garbage collector. All heap memory that is allocated must be freed manually.

Turing supports some form of concurrency with its processes (yes, each process does actually start a new thread), but it has almost no control over communication between threads, synchronization, nor control of thread lifetimes. Turing has a fork(), but no join(), no locks, now condition variables, no mutexes; it even fails to specify whether variables can be treated as atomic.

Variables are allocated at run-time (the majority of variables), because otherwise a recursive algorithm wouldn't work very well.