INTRODUCTION TO MODERN COMPUTING, SOFTSKILLS, COMPUTATION THEORY
A. Computational Theory
Computational Theory is a branch of Computer Science & Mathematics that discusses how problems can be solved through computational models efficiently using algorithms. Computational theory itself is divided into three focuses, namely; Languages and automata theory, recursion theory & computational complexity theory.
1. Language & Automata Theory
Language & Automata Theory is part of computational theory in computer science, some computational theories come from language and systems engineering, especially those based on mathematics. This basic idea is modeled with symbols that also represent a function of a digital computer.
2. Recursion Theory
Recursive theory is a method in the world of mathematics which is defined as a function that contains the function itself. In the world of programming, recursion is implemented in a function that calls itself.
3. Computational Complexity Theory
Complexity Theory is the study or study of complex systems, complexity means totality or whole, a science that studies the totality of dynamic systems as a whole. In general, it can be said that a system is said to be complex if the system consists of many components or sub-units that interact with each other.
In general, computational science is a science that is concerned with the preparation of mathematical models and numerical solution techniques as well as the use of computers to analyze and solve problems.
Computational Theory can also be considered as a model for the creation of all branches in the field of computer science. Therefore, logic and mathematics are used in this computational theory. In this century, computational theory became an independent academic discipline and was separated from mathematics. The following are pioneers in the field of computational theory ;
1. Alan Turing
Alan Turing, as the originator of computational theory, created a machine that could perform mathematical calculations
The Turing Machine is a theoretical computing model discovered by Alan Turing, this machine can also function as an ideal model for carrying out mathematical calculations. The Turing Machine is known for the quote "Anything a Turing Machine can do a computer can do"
Source :
https://deadydiedy.wordpress.com/2015/04/05/komputasi-teori-komputasi/
https://helmifadhiel.wordpress.com/2018/03/11/pengertian-teori-komputasi-dan-pengimplementasiannya/
0 comments:
Post a Comment