Termination Johannes Waldmann, HTWK Leipzig, Germany A (possibly non-deterministic) program is called (uniformly) terminating if for each input, each computation is finite. Termination is undecidable but important for applications. This motivates the search for partial decision procedures that correctly answer Yes or No in a lot of cases, but may also print "Don't Know", or do not answer at all. While termination analysis of (imperative, functional, logic) programs is one goal, fundamental termination research is mostly done in the computation model of term rewriting. In the talk, I will survey methods for proving termination and non-termination of rewriting, using mainly examples from string rewriting, that is term rewriting where all symbols are unary. String rewriting systems are well known as production rules of formal grammars of Chomsky type 0. With this "taste of rewriting", the talk also serves to advertise the 9th International School on Rewriting, to be held at Sydney University in February 2016. Dr. Waldmann ( http://www.imn.htwk-leipzig.de/~waldmann/ ) is a participant, organizer, and steering committee member of Termination Competitions ( http://termination-portal.org/wiki/Termination_Competition ) and co-invented the termination proof methods of match-bounds and matrix interpretations that are now widely used. He was a lecturer at the Intl. School on Rewriting (ISR) 2014, and the local organizer of ISR 2015 ( http://cbr.uibk.ac.at/ifip-wg1.6/summerschool.html )