HOME
ABOUT US
LINK TO US
SITE MAP
CONTACT US
Login
SignUp
CATEGORIES
Android Programming
ASP.NET
C
C#
C++
Computer Science
Databases
Information Technology - IT
Internet
iPhone Programming
IT Security
Java
Java EE
JavaScript
Linux
Microsoft Office
NET
Networking
Open Source
Perl
PHP
Physics
Programming
Project Management
Python
Revision Control
Ruby
Smalltalk
Software Engineering
SQL
Video Games
Web Development
Windows
XML
AI and Robotics
Ada
Your are Here:
Turing
File Type :PDF
Number of Pages :-500
Description
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any Turing machine.