ABSTRACT
The problem of determining the representation type of a given finite dimensional algebra A leads to purely combinatorial algorithms and classifications. In many cases these can only be handled with the help of a computer. The aim of our paper is to explain this in details for finite representation type. Moreover we mention similar developments for tame representation type and also for related topics like unit forms, vectorspace categories and Coxeter transformations. For examples of concrete realizations of the mentioned algorithms we refer to the program package CREP.
