The T3F Mathematical Statistics session on February 20, 1973, covered several topics in random number generation and related algorithms. T. G. Lewis presented a new pseudorandom number generator based on primitive trinomials over GF(2), which offers superior statistical properties and an "unlimited" period determined by memory size, making it suitable for small computers. J.A. Archibald and P.W. Fleury discussed non-cyclic random number generators, highlighting their advantages over cyclic generators in terms of uniformity and unpredictability. Preston C. Hammer argued that the concept of randomness is fundamentally nonsensical, while Mark B. Wells explored the use of sets as a data structure in computing, particularly in programming languages like SETL and Madcap. Peter V. Loept and June F. Smith introduced an algorithm for finding the median of an unordered list, and Tina S. M. Wilard II presented algorithms for polynomial operations over real algebraic number fields. James F. Peterson discussed matrix representations of finite semigroups, Leonard H. Trippe proposed a model for merging finite element matrices, and James H. Morris, Jr. introduced the descendant function for proving properties about pointer manipulation programs. The session concluded with discussions on user-computer interaction and system performance measures, including a model for use logging, accounting, and allocation, and methods to improve relations between users and systems programmers.The T3F Mathematical Statistics session on February 20, 1973, covered several topics in random number generation and related algorithms. T. G. Lewis presented a new pseudorandom number generator based on primitive trinomials over GF(2), which offers superior statistical properties and an "unlimited" period determined by memory size, making it suitable for small computers. J.A. Archibald and P.W. Fleury discussed non-cyclic random number generators, highlighting their advantages over cyclic generators in terms of uniformity and unpredictability. Preston C. Hammer argued that the concept of randomness is fundamentally nonsensical, while Mark B. Wells explored the use of sets as a data structure in computing, particularly in programming languages like SETL and Madcap. Peter V. Loept and June F. Smith introduced an algorithm for finding the median of an unordered list, and Tina S. M. Wilard II presented algorithms for polynomial operations over real algebraic number fields. James F. Peterson discussed matrix representations of finite semigroups, Leonard H. Trippe proposed a model for merging finite element matrices, and James H. Morris, Jr. introduced the descendant function for proving properties about pointer manipulation programs. The session concluded with discussions on user-computer interaction and system performance measures, including a model for use logging, accounting, and allocation, and methods to improve relations between users and systems programmers.