Discrete Mathematics II - Lecture 5

Themen:

• Algorithmus von Kruskal 
• Sehnen und Fundamentalkreise
• Flussnetze
• Flüsse und Schnitte

Computability & Complexity - Lecture 3

Topics:

Closure properties of the class of primitive recursive functions:

• definition by cases
• bounded sum and product
• bounded minimization
• iteration.

Primitive recursive sets:

• characteristic function
• bounded existential and universal quantification.

Discrete Mathematics II - Lecture 4

Heutige Themen:

• Netzwerke
• Floyd-Warshall
• Dijkstra
• minimale Spannbäume
• Satz von Cayley.

Discrete Mathematics II - Lecture 3

Themen:

• Kriterien für die Planarität von Graphen
• Satz von Kuratowski
• Adjazenz- und Inzidenzmatrizen, Adjazenzlisten
• Tiefen- und Breitensuche.

Computability & Complexity - Lecture 2

Topics:.

• Peano schemes
• Fundamental lemma
• Primitive recursion
• Class of primitive recursive functions
• Each primitive recursive function is URM computable
• Closure properties: transformation of variables and parametrization.

Discrete Mathematics II - Lecture 2

Heutige Themen:

• Zusammenhangskomponenten
• Graph-Metrik
• Bäume
• Spannbäume
• bipartite Graphen
• planare Graphen
• Eulersche Polyederformel

Computability and Complexity - Lecture I

The first lecture held on Friday provided an introduction to register machines (URMs):

• states and state transformations
• syntax of URM programs
• semantics of URM programs.