Lecture notes for the course “Foundations of Computer Science”
TeX
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
img
Makefile
README.rst
bibliography_de.bib
bibliography_en.bib
contents
definitions.tex
document.tex
errata.txt
gdi001_intro_de.tex
gdi001_intro_en.tex
gdi002_bits_de.tex
gdi002_bits_en.tex
gdi003_logic_de.tex
gdi003_logic_en.tex
gdi004_set_theory_de.tex
gdi004_set_theory_en.tex
gdi005_turing_de.tex
gdi005_turing_en.tex
gdi006_graph_de.tex
gdi006_graph_en.tex
gdi007_encoding_de.tex
gdi007_encoding_en.tex
gdi008_abstraction_de.tex
gdi008_abstraction_en.tex
gdi009_landau_de.tex
gdi009_landau_en.tex
gdi010_algo_de.tex
gdi010_algo_en.tex
gdi011_complexity_de.tex
gdi011_complexity_en.tex
gdi012_lang_de.tex
gdi012_lang_en.tex
gdi013_people_de.tex
gdi013_people_en.tex
includes.tex
titlepage_de.tex
titlepage_en.tex

README.rst

gdi_doc

last update:30th of Nov 2013
Author: Lukas Prokop
license:Public Domain
Version: 1.0 "moebius"

Script for the course “Foundations of Computer Science”.

Roadmap

1.0
Accepted by Q&A.
1.1
  • Consider future of encoding chapter.
  • Introduce proof of halting problem.
1.2

Release if the following sections are ready:

  • Redesign of tables 3.10, 3.11 and 3.12 to make them more self-explanatory.
  • Check whether or not a nice cheatsheet for boolean logic is given including all laws by DeMorgan.
  • Fix TODO flags of boolean logic section and make section more axiomatic.
  • Introduce notes how to cope with NP-complete problems in programming.
  • Better description for Chomsky hierarchy (more precise description of distinction of classes).
1.4 Release if the following sections are ready:
  • Elaborate a bit more on Church-Turing thesis.
  • "Solving logic problems" (by examples).
1.6 Release if the following sections are ready:
  • Provide a more formally description for an NTM. Describe SAT-problem better.
  • Elaborate on NP-hardness.
  • Show hardness of SAT.
2.0 Release if the following sections are ready:
  • Introduce known problems: 3SAT, 2SAT, HORNSAT, KNAPSACK, TSP.
  • English translation available.

greets, prokls