This thesis discusses an implementation of an algorithm for deciding if certain words are additive k-power-free. We use the algorithm to prove new results and to reprove several old results. In particular we construct an infinite additive 5-power-free binary rich word. We reprove that certain infinite binary words found by others are additive 4-power-free.
