Software for detecting Brauer-Manin obstructions? In the context of another MO question, the following question arose: Does there exist any software for detecting Brauer–Manin obstructions to the existence of integer solutions to a single polynomial equation?
Failing that, has anyone written down a detailed description of such an algorithm?
It may be that one (ahem) obstruction to the existence of such software is that the standard accounts of the Brauer–Manin obstruction are written in the language of modern algebraic geometry, which is unfamiliar to many people who might otherwise have the right skills to write the software.  To some extent, such language is unavoidable, but it would be nice to have an account that is as elementary as possible.  Perhaps some of the building blocks have already been implemented in (say) Sage, and it is not too hard to explain what is needed to put them together.
 A: I strongly disagree with the assertion that "the language of modern algebraic geometry [...] is unfamiliar to many people who might otherwise have the right skills to write the software". You are denying the existence of a flourishing research field, computational arithmetic geometry! See e.g. this paper:
Bright, M. J.; Bruin, N.; Flynn, E. V.; Logan, A., The Brauer-Manin obstruction and $\text{Ш}[2]$, LMS J. Comput. Math. 10, 354-377 (2007). ZBL1222.11084.
From the abstract: "We discuss the Brauer-Manin obstruction on del Pezzo surfaces of degree 4. We outline a detailed algorithm for computing the obstruction and provide associated programs in MAGMA."
This isn't exactly the same question as you asked, since the relevant surfaces are intersections of two quadrics in $\mathbf{P}^4$, so not defined by a single equation; but it should serve to demonstrate that there is a substantial literature focussing on explicit algorithmic computations of the Brauer--Manin obstruction -- maybe you can find something matching your question more precisely among papers citing (or cited by) this one.
