CS-Notes-byCKL
Primary version
Primary version
  • First Page
  • PHP Notes
    • How a Theme Is build
  • Applied Machine Vision
    • The Pinhole Camera Model
    • Linear Algebra Recap
  • NLU/NLP Chatbot powerd by Rasa for Telekom
    • RASA
      • Terminology and Definitions and structure of a bot
      • Rasa Core Vs Rasa NLU
      • Rasa NLU
        • Training and Data Format RASA NLU
        • Entity Extraction
        • Evaluation
      • Preprocessing Methods
        • Bag of Words
      • Setup
  • Evalutation/Testing
  • Distributed Sytems
    • Week 1
    • Java I/O
  • Diskrete Strukturen
    • 1. Kombinatorik
      • Kombinatorische Beweisprinzipien
      • Ziehen von Elementen aus einer Menge
      • Wichtige Zählprobleme
      • Rekursionsgleichungen
    • 2. Zahlentheorie
      • Teilbarkeit und Primzahlen
      • Modulare Arithmetik
      • Vermischtes
    • MIT Week 1 Proofs
    • 3. Graphentheorie
      • Modellieren von Graphen
      • Grundbegriffe
      • Bäume und Wälder
      • Graphen Eigenschaften
    • 4. Algebraische Strukturen
      • Verbände
      • Isomorphe und homomorphe Abbildungen
  • Fingerprint extraction of electrical appliances
    • 1. Data Preprocessing
    • 2. Transition Detection
  • AI in a nutshell
Powered by GitBook
On this page
  1. Diskrete Strukturen

MIT Week 1 Proofs

There are multiple types of proofs, mathematical, .. , ..

In general, a proof is a method for ascertaining truth ( asc. means verifying)

Truth is always opposite of not true.

Truth is eastablisehd by :

-Juries , Sampling and counterprooving falsehood , Experiments and observation

A Mathematical proof consistis of :

Propositions : A proposition is a Statement, that is either True or False

Prädikat(Predicate) : A Proposition, whose truth depends on the value of a variable (for all N, X, etc..)

PreviousVermischtesNext3. Graphentheorie

Last updated 7 years ago