Computations with infinite nearrings inevitably lead to undecidable problems. In practice, the same is already true for finite nearrings of sizes above . Currently, only d.g. nearrings of that size can be handled properly. On the other hand, quite a lot can be done with finitely generated rings, and there is hope to save a reasonable portion of computability to other special types of infinite nearrings, such as polynomial nearrings (), even bigger d.g. nearrings (), nearrings generated by one element, and others. Some first results concerning this are contained in . Also, even partial solutions such as semialgorithmic, probabilistic, or approximative methods are of high value for the solution of many problems. There is already some experience in computing with such objects (, ).