Turing occurs as Pascal-like programming language developed in 1982 by Ric Holt and James Cordy, then of University of Toronto, Canada.

Turing occurs as descendent of Euclid that features a filtered syntax & accurate machine-independent semantics. These are utilized primarily as a teaching language at a high & university level. 2 more versions survive, Object-Oriented Turing and Turing Plus, a systems programming variant. Within September 2001, "Object Oriented Turing" was renamed "Turing" & a original Turing was renamed "Classic Turing". Turing is available from either [http://www.holtsoft.com Holt Software Associates] in Toronto. Versions for Unix, Microsoft Windows and Apple Macintosh are available.

The brief case of Turing is the charted recursive function to calculate a factorial.

%Accepts the total & calculates its factorial work factorial (north: int) : real inorth case n = Zero then symptom 1 else symptom north * factorial(north-One) prevent if prevent factorial volt-ampere north: int loop put "Please input an integer :" .. make their way n exit while north >= 0 put "Input must be a non-negative integer." prevent loop put "The factorial of ", north, " is ", factorial(north)

On this text occurs as sample Hello World program in Turing:

put "Hello World!"