Summary: We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the maximum width, if it exists, of geodesic bigons in the Cayley graph of a finitely presented group \(G\). Our procedure will terminate if and only this maximum width exists, and it has been proved by Papasoglu that this is the case if and only if \(G\) is word-hyperbolic. So the algorithm amounts to a method of verifying the property of word-hyperbolicity of \(G\). The aim of the second algorithm is to compute the thinness constant for geodesic triangles in the Cayley graph of \(G\). This seems to be a much more difficult problem, but our implementation does succeed with straightforward examples. Both algorithms involve substantial computations with finite state automata.