THX.

  • Posts
  • Notes
  • About
  • Support

Y4S1

Y3S2

  • Augmented Reality

  • Computability And Logic

    • 1. Mathematical Tools and Techniques

    • 2. Languages and Operations

    • 3. Finite Automata

    • 4. Regular Expressions, Nondeterminism, and Kleene’s Theorem

    • 5. Conversions between NFA, DFA, RE

    • 6. Propositional Logic

    • 7. Predicate Logic

    • 8. Distinguishability and Minimisation

    • 9. Pumping Lemma and Closure Properties

    • 10. Context-free Grammar

    • 11. Push-down Automata

    • 12. Deterministic Context-Free Languages

    • 13. Turing Machines

    • 14. Variations of Turing Machines

    • 15. Recursive and Recursively Enumerable Languages

    • 16. Turing Machines and Unrestricted Grammars

    • 17. Linear-time Temporal Logic – Model Checking

    • 18. Program Verification - Hoare Logic

    • 19. Satisfiability Solvers

    • 20. Problem Reduction

    • 21. P vs NP

  • Database

Y2S2

Y2S1

Y1S2

Leetcode

The Art Of Computer Programming

Y1S1

Innovation - From Creativity to Entrepreneurship

Introduction to Data Science in Python

Algorithmic Toolbox

AP Computer Science A - Java Programming

Competitive Programming

HuggingFace Reinforcement Learning

Designed & Built by Toh Hong Xiang - 2022