Turing is a Pascal like programming language developed in 1982. In computability theory, a system of data manipulation rules is said to be Turing complete or computationally universal if it can be used to simulate any single-Taped Turing machine. Turing is particularly appropriate as a first language for learning and teaching. It incorporates many of the advantages while avoiding most of the disadvantages of earlier languages. The following features make Turing particularly suitable as a first language.

- we can write one-line program in Turing.
- Turing is defined by simple rules with few exceptions.
- Turing is a standardized language. Most Turing program will run on a Macintosh or a UNIX workstation and give the same result.
- Turing has a formal definitions and semantics.

function factorial (n: int) : real if n = 0 then result 1 else result n * factorial (n - 1) end if end factorial var n: int loop put "Please input an integer: " .. get n exit when n >= 0 put "Input must be a non-negative integer." end loop put "The factorial of ", n, " is ", factorial (n)

Basic Subject

Computer Science

- Programming Assignment Help
- Database Help
- Data Structure Assignment Help
- Operating Systems Assignment Help
- Computer Network Assignment Help
- UML Diagram Assignment Help
- IT Assignment Help
- Game Programming
- Computer Science Assignment Help
- Medical Science Assignment Help
- Social Science Assignment Help
- Information Systems

Engineering

- Biochemical and Biotechnology Help
- Chemical Engineering Assignment
- Statistics Assignment Help
- Civil Engineering Assignment Help
- Electrical, Electronics Help
- Mathematics, Computing Assignment Help
- Mechanical and Industrial Engg. Help
- Petroleum Engg. Assignment Help
- Biochemistry Assignment Help
- Cell Biology Assignment Help
- Arts and Architecture Help
- Silverlight Assignment Help