We present recent developments in a novel domain of computational group theory: computing with infinite linear groups. Special consideration is given to algorithms for Zariski dense subgroups. This includes a computer realization of the strong approximation theorem, and algorithms for arithmetic groups. We illustrate applications of our methods to the solution of problems further afield by computer experimentation. This is joint work with Dane Flannery and Alexander Hulpke.