Decidability (Mathematical logic)

The Classical decision problem / by: (Language materials, printed)

The classical decision problem / by: (Language materials, printed)

Reachability problems = 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010, proceedings / by: (Language materials, printed)

Undecidability, uncomputability, and unpredictability by: (Electronic resources)

Reachability problems = 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012 : proceedings / by: (Electronic resources)

Reachability problems = 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014 : proceedings / by: (Electronic resources)

Mathematical Logic and Formal Languages.

Software Engineering.

Mathematical Logic and Foundations.

Logics and Meanings of Programs.

Probability Theory and Stochastic Processes.

Computer systems- Verification

Algorithm Analysis and Problem Complexity.

Computation by Abstract Devices.

History and Philosophical Foundations of Physics.

Programming Languages, Compilers, Interpreters.

Computer science- Mathematics

Incompleteness theorems.

Coding and Information Theory.

Completeness theorem.

Quantum theory.

Decidability (Mathematical logic)

Graph theory- Data processing

Computer Science.

Theoretical, Mathematical and Computational Physics.

Philosophy of Science.