PTAS for Planar Subset-Connectivity Problems - Professor Christian Sommer - Alogrithem - Lectures 15 of 23 - Video-lecture

Video-lecture, Algorithms and Programming

Description: The lecture is about Algorithm. In this lecture Professor Christian Sommer tells ud about Structured programming, canonical structures: Per the Church-Turing thesis any algorithm can be computed by a model known to be Turing complete, and per Minsky's demonstrations Turing completeness requires only four instruction types—conditional GOTO, unconditional GOTO, assignment, HALT. Lecture15 of 23
Document information