This 100% online Postgraduate certificate offers a practical knowledge update on Theoretical Computer Science, without sacrificing the highest academic rigor”

This program is aimed at those interested in attaining a higher level of knowledge in Theoretical Computer Science. The main objective is for students to specialize their knowledge in simulated work environments and conditions in a rigorous and realistic manner so they can later apply it in the real world.

This program will prepare scientifically and technologically, as well as to develop the professional practice of software engineering, with a transversal and versatile approach adapted to the new technologies and innovations in this field. Students will gain extensive knowledge of Theoretical Computer Science from professionals in the field. 

The students will be able to take the opportunity and study this program in a 100% online format, without neglecting their obligations.

Learn the latest techniques and strategies with this program and achieve the success as a Computer Engineer”

This Postgraduate certificate in Theoretical Computer Science contains the most complete and up-to-date educational program on the market. Its most outstanding features are:

• Development of 100 simulated scenarios presented by experts in Theoretical Computer Science
• The graphic, schematic and practical contents with which they are conceived provide scientific and practical information on geography
• News on the latest developments in Theoretical Computer Science
• It contains practical exercises where the self-assessment process can be carried out to improve learning
• Interactive learning system based on the case method and its application to real practice
• All of this will be complemented by theoretical lessons, questions to the expert, debate forums on controversial topics, and individual reflection assignments
• Content that is accessible from any fixed or portable device with an Internet connection

Learn about Theoretical Computer Science with this intensive program, from the comfort of your home”

It includes in its teaching staff professionals belonging to the field of education, who bring to this program their work experience, in addition to recognized specialists belonging to reference societies and prestigious universities.

Thanks to its multimedia content developed with the latest educational technology, this Postgraduate certificate will allow the professional a situated and contextual learning, that is to say, a simulated environment that will provide an immersive learning programmed to learn in real situations.

This program is designed around Problem-Based Learning, whereby the students must try to solve the different professional practice situations that arise throughout the program. To that end, they will be assisted by an innovative, interactive video system created by renowned experts in Theoretical Computer Science who have extensive teaching experience.

Take advantage of the latest educational technology to get up to date on Theoretical Computer Science without leaving your home"

Learn about the latest techniques in Theoretical Computer Science from experts in the field"

The structure of the contents has been designed by a team of Computer Engineering professionals, aware of the relevance of current education to delve into this field of knowledge, in order to humanistically enrich the student and raise the level of knowledge in Theoretical Computer Science through the latest educational technologies available.

This Postgraduate certificate in Theoretical Computer Science contains the most complete and up-to-date educational program on the market”

Module 1. Theoretical Computer Science

1.1. Mathematical Concepts Used

1.1.1. Introduction to Propositional Logic
1.1.2. Theory of Relations
1.1.3. Numerable and Non-Numerable Sets

1.2. Formal Languages and Grammars and Introduction to Turing Machines

1.2.1. Formal Languages and Grammar
1.2.2. Decision Problem
1.2.3. The Turing Machine

1.3. Extensions to Turing Machines, Constrained Turing Machines and Computers

1.3.1. Programming Techniques for Turing Machines
1.3.2. Extensions for Turing Machines
1.3.3. Restricted Turing Machines
1.3.4. Turing Machines and Computers

1.4. Indecibility

1.4.1. Non-Recursively Enumerable Language
1.4.2. A Recursively Enumerable Undecidable Problem

1.5. Other Undecidable Problems

1.5.1. Undecidable Problems for Turing Machines
1.5.2. Post Correspondence Problem (PCP)

1.6. Intractable Problems

1.6.1. The Classes P and NP
1.6.2. A NP-Complete Problem
1.6.3. Restricted Satisfiability Problem
1.6.4. Other NP-Complete Problems

1.7. Co-NP and PS Problems

1.7.1. Complementary to NP Languages
1.7.2. Problems Solvable in Polynomial Space
1.7.3. Complete PS Problems

1.8. Classes of Randomization-Based Languages

1.8.1. MT Model with Randomization
1.8.2. RP and ZPP Classes
1.8.3. Primality Test
1.8.4. Complexity of The Primality Test

1.9. Other Classes and Grammars

1.9.1. Probabilistic Finite Automata
1.9.2. Cellular Automata
1.9.3. McCulloch and Pitts Cells
1.9.4. Lindenmayer Grammars

1.10. Advanced Computing Systems

1.10.1. Membrane Computing: P-Systems
1.10.2. DNA Computing
1.10.3. Quantum Computing

A unique, key, and decisive educational experience to boost your professional development”