It is our pleasure to announce a series of guest lectures that will be held at SSST and our CSIS Department in December 2017. On 14-16 December, Prof. Dr. Ladislav Novak (Indiana University, USA) will give lectures at SSST on the following topics:
I. A BRIEF UNIFIED INTRODUCTION TO FOUNDATIONS OF MATHEMATICS, COMPUTING THEORY AND COMPUTATIONAL COMPLEXITY (Thursday, Dec 14, 17:00 -18:30 and Friday, Dec 15, 17:00 - 20:00)
II. INTRODUCTION TO RESEARCH METHODS AND WRITING RESEARCH PAPERS AND CONTRIBUTION OF THE ARAB WORLD TO THE MATHEMATICS AND COMPUTING (Saturday, Dec 16, 9:00 - 13:00).
No prior knowledge is required to follow these lectures. The venue for all lectures is the Ali Al-Jaffali Auditorium (125).
All SSST students, alumni and staff, as well as anybody else who might be interested in hearing an expert on these subjects are welcome to attend.
Please see the full schedule below.
GUEST LECTURES at CSIS Department (SSST)
14-16 December 2017
By Prof. Ladislav Novak, Indiana University, USA
Venue: Ali Al-Jaffali Auditorium (125), SSST
Thursday, 14 December, 17:00 -18:30
FOUNDATIONS OF MATHEMATICS (one lecture, 1.5 hours)
- The holy trinity: sets, relations and logic
- Basic sets and constructions
- Relations and functions
- Intuitionistic logic vs classical logic
- Classical approach to math: Zermelo-Fraenkel axioms - you should see them once in your life time and then happily forget
- An alternative approach to the theory of everything in math: Category Theory
- Computing Theory as a true foundation of Mathematics
Friday, 15 December, 17:00 - 20:00
COMPUTING THEORY (two lectures, 1.5 hours each)
- Infinity and how to cope with it: constrictive mathematics vs classical mathematics
- Whether infinite sets do exists?
- Natural numbers - our very first infinite set
- Gödel, Post, Turing and friends
- Why is Time in Mathematics divided into BG (before Gödel) and AG (after Gödel)?
- Enumerable sets
- Quasi-effective computation
Constructive space - a proper scene where effective computation lives
- Three facets of the EFFECTIVE COMPUTATION: Enumerators (Sets), Transducers (Relations) and Verifiers (Logic)
- Computable and computably enumerable sets
- The axiom of choice and why it is not welcomed in computational theory?
- Limit points and logic negation
- Simple and creative sets
- Gödel Incompleteness Theorem as creative set of statements
COMPUTATIONAL COMPLEXITY (one lecture, 1.5 hours)
- Bounded finite resources: time and space
- P vs NP
- NP completeness
- Brief review of other topics in Computational Complexity
Saturday, 16 December, 9:00 - 13:00
RESEARCH METHODS AND WRITING RESEARCH PAPERS (2 lectures, 1.5 each)
- Introduction to research methods and writing research papers
- Case study on writing essays tailored for Computer Science major
- BBC VIDEO (one hour or so)
- Contribution of the Arab World to the mathematics and computing - author: Bettani Hughes, English historian