Inner algorithm to test for positive definiteness of arbitrary binary forms

It is shown how the test for positive definiteness of an arbitrary binary form can be expressed in terms of an inner algorithm. An example is used to illustrate the computational aspects of the procedure.