IRR: Theoretical Computer Science

Theoretical Computer Science

What differentiates the sub-area from the other programmes on the Informatics MSc portfolio?

Theoretical Computer Science (TCS) is the use of mathematical thinking and techniques to understand computer science. It ranges from logical, even philosophical, questions such as ‘what is computation?’, to quite practical questions such as ‘how can we know whether our algorithm is the fastest possible for this problem?’. 

Are there go-to sources to find reviews and perspectives on these research topics. i.e. are there any good review journals that are worth browsing to get topic overviews.

The recording of the semesters and workshop organized at the Simon Institute for the Theory of Computing https://simons.berkeley.edu/ are a great place to look for tutorials for beginners and at the same discussions on rapidly growing areas of research.

What are the key journals or conferences in the field for finding high quality research papers in these topics 

Algorithms and Complexity: 

Logic, Semantic and Concurrency:

Programming Languages and Foundations:

Verification, Testing, and Model Checking:

Are there any particular high profile or rapidly growing research areas in the programme that you would suggest might be worth looking at for potential IRR themes. 

Algorithms and Complexity: 

  • High dimensional expanders 

Programming Languages and Foundations:

  • Algebraic Effects and Handlers

  • Program Synthesis

  • Smart Contracts

  • Gradual Typing

Verification, Testing, and Model Checking:

  • Compiler Verification

  • Specification and verification of processor architectures

  • Use of quantitative evaluation/verification with machine learning in a variety of different ways (verification of the ML/using ML to make the verification more efficient/….)

 

License
All rights reserved The University of Edinburgh