Please enable JavaScript.

Coggle requires JavaScript to display documents.

Computer Science, Computer, Software, Formal Language - Coggle Diagram

- - - - Data Structures
      - Information Theory
      - Machine Learning
      - Very-Large-Scale Integration
      - Coding Theory
      - Computational Biology
      - Programming Language Theory and Formal Methods
      - Theory of Computation
        
        Automata Theory
        
        Computability Theory
        
        Model of Computation
        
        Circuit
        
        Definition
        
        A model which describes how an output of a mathematical function is computed given an input
        
        Definition
        
        Also known as recursion theory, a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of compuable functions and Turing degrees
        
        Computable, Recursive, Decidable (Set)
        
        Definition
        
        A set of natural numbers is said to be recursive if there is an algorithm which takes a number as input, terminates after a finite amount of time, and correctly decides whether the number belongs to the set or not
        
        Computational Complexity Theory
        
        Definition
        
        The branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree
      - Cryptography
    - - A problem that may be solved by an algorithm
  - - - ISA, Instruction Set Architecture
      - Microarchitecture :
      - Logic Design
      - Implementation :question:
- - - - Instructions
    - - Edit Time
      - Compile Time
      - Link Time
      - Distribution Time
      - Installation Time
      - Load Time
      - Run Time
- - - - Garbage
- - - - Source Code
        
        Low-Level Programming Language
        
        Assembly Language
        
        Machine Code
        
        Instructions
      - Formal Language