LightBlog
Contact at mumbai.academics@gmail.com or 8097636691/9323040215
Responsive Ads Here

Saturday, 3 March 2018

Foundations of Computing

 Foundations of Computing
  • The Foundations Of Logic and Proofs
  • Basic Structures: Sets, Functions, Sequence, Sums, Matrices
  • Algorithms
  • Number Theory and Cryptography
  • Indution and Recursion
  • Counting
  • Discrete Probability
  • Advanced Counting Techniques
  • Relations
  • Graphs
  • Trees
  • Boolean Algebra
  • Modelling Comutation
  • Automata and languages
  • Regular languages
  • Context-free languages
  • Computability theory
  • The Church-Turing thesis
  • Decidability
  • Reducibility
  • Advanced topics in computability theory
  • Complexity theory
  • Time complexity
  • Space complexity
  • Interactibility
  • Advanced topics in complexity theory
  • Fundamental Principles of Computing
  • Fundamentals of Logic
  • Set Theory
  • Mathematical Induction
  • Relations and Funtions
  • Finite State Machines
  • Relations: The Second Turn around
  • The Principle of Inclusion and Exclusion
  • Generating Functions
  • Recurrence Relations
  • Graph Theory
  • Rings and Modular Arithmetic
  • Boolean Algebra and Switching Functions
  • Algebraic Structure
  • Semigroups
  • Monoids
  • Groups
  • Coding Theory
  • Polys’s Meathod of Enumeration
  • Finite Fields and Combinational Designs
  • No comments:

    Post a Comment