Effective detection of nonsplit module extensions

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every at most-n-dimensional representation of R is semisimple, and (2) if there exist nonsplit extensions of non-isomorphic irreducible R-modules whose dimensions sum to no greater than n.