Gerald S. Guralnik

Learn More
There is a complex relationship between the architecture of a computer, the software it needs to run, and the tasks it performs. The most difficult aspect of building a brain-like computer may not be in its construction, but in its use: How can it be programmed? What can it do well? What does it do poorly? In the history of computers, software development(More)
Quantum field theories and Matrix models have a far richer solution set than is normally considered, due to the many boundary conditions which must be set to specify a solution of the Schwinger-Dyson equations. The complete set of solutions of these equations is obtained by generalizing the path integral to include sums over various inequivalent contours of(More)
This work develops and applies the concept of mollification in order to smooth out highly oscillatory exponentials. This idea, known for quite a while in the mathematical community (mollifiers are a means to smooth distributions), is new to numerical Quantum Field Theory. It is potentially very useful for calculating phase transitions (highly oscillatory(More)
I discuss historical material about the beginning of the ideas of spontaneous symmetry breaking and particularly the role of the Guralnik, Hagen Kibble paper in this development. I do so adding a touch of some more modern ideas about the extended solution-space of quantum field theory resulting from the intrinsic nonlinearity of non-trivial interactions.
We develop a new representation for the integrals associated with Feynman diagrams. This leads directly to a novel method for the numerical evaluation of these integrals, which avoids the use of Monte Carlo techniques. Our approach is based on based on the theory of generalized sinc (sin(x)/x) functions, from which we derive an approximation to the(More)