Vita for Carter Bays email: bays@sc.edu PHONE: h - 800-332-2297 WEB SITE: www.cbays.com EDUCATION B.S. Math, Purdue University. M.S. Computer Science, University of Oklahoma. PhD. Computer Science, University of Oklahoma. ACADEMIC POSITIONS at the UNIVERSITY OF SOUTH CAROLINA DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING 6/02 - pres. Distinguished Professor Emeritus 5/93 - 6/02 Professor 5/81 - 5/93 Associate Professor 9/75 - 5/81 Assistant Professor TEACHING QUALIFICATIONS I have taught a large number of courses, including Operating Systems, Programming Language Features, Data Structures, Analysis of Algorithms, Computer Graphics, and a variety of programming languages and other courses. CURRENT INTERESTS 1) Algorithm Development 2) Web Site Usability and Usability in General (Occasional Consultant) 3) Cellular Automata (Invited Member of the Editorial Board, Journal of Cellular Automata, 2005 - present) MOST CURRENT WORK 1) Invited to write two articles for "The Encyclopedia of Complex Systems (Springer-Verlag, 2009) 2) Invited to write the introductory chapter (and one other) for a book about John Conway's "Game of Life" (title of book unknown at this time), editor Andrew Adamatzky, to be published by Springer-Verlag, 2010. SOME IMPORTANT EARLIER RESULTS "Improving a Poor Random Number Generator". This nifty algorithm, which is executed in O(1) (no more than 10 assembler language instructions), is the standard method employed when the need for a series of random numbers is required, yet nothing is known about the type or source of the underlying random number generator, RNG (See "Bays-Durham"). Current needs however typically require that we know something about our source of random numbers. Probably the best and simplest RNG now in use is Marsaglia's 32 bit "multiply with carry", using a table size of 256. This RNG is said to have a period of about 2^8222. "A Comparison of Next-fit, First-fit, and Best-fit." This short note settled the question of which memory allocation among the three was the best. "Candidates for the Game of Life in Three Dimensions." This discovery, the three dimensional version of John Conway's famous two dimensional cellular automaton, received much attention (hundreds of letters) after an article regarding this research appeared in Scientific American (Feb. 1987). REFEREED ARTICLES text citations
Carter Bays "The Discovery of Glider Guns in a Game of Life for the Triangular Tessellation." Journal of Cellular Automata 2,4 (2007), pages 345-350 Carter Bays, "A Note about the Discovery of Many New Rules for the Game of Three Dimensional Life." Complex Systems 16 (2006), pages 381-386. Carter Bays, "A Note on the Game of Life in Hexagonal and Pentagonal Tessellations.", Complex Systems 15 (2005), pages 245 - 252. Carter Bays and Hudson, Richard H., "Zeroes of Dirichlet $L$-functions and Irregularities in the distribution of primes." Mathematics of Computation, June 2000. Carter Bays and R. H. Hudson, "A new bound for the Smallest x with pi(x) < li(x)," Mathematics of Computation, June 2000. Carter Bays, "Cellular Automata in the Triangular Tessellation." Complex Systems 8 1994, pages 127-150. Carter Bays, "Further Notes on the Game of Three Dimensional Life." Complex Systems 8 1994, pages 67-73. Carter Bays, "A New Candidate Rule for the Game of Three-Dimensional Life." Complex Systems 6 1992, pages 433-441. Carter Bays and W.E. Sharp, "A Review of Portable Random Number Generators." Computer & Geosciences 1992, Vol. 18, No. 1. pages 79-87. Carter Bays and W.E. Sharp, "Improved Random Numbers for Your Personal Computer or Workstation." GEOBYTE April 1992, page 25-32. Carter Bays and W. E. Sharp, "Generating Random Numbers in the Field." Mathematical Geology, 1991, Vol. 23, No. 4. Pages 541-547. Carter Bays and Margaret Anne Pierce, "Applications of the Collision Test to Produce Results consistent with the Spectral Test," Simulation 57:5, 1991, pages 335-343. Carter Bays, "A New Game of Three-Dimensional Life." Complex Systems 5 1991, pp 15-18. Carter Bays, "Improving A Poor Random Number Generator: a Comparison Between Two Shuffling Methods." Journal of Statistical Computation and Simulation Vol. 36, No. 1, (1990) Pages 57-59. Carter Bays,"Classification of Semitotalistic Cellular Automata in Three Dimensions." Complex Systems 2 1988, pages 235-254. Carter Bays,"A Note on the Discovery of a New Game of Three-dimensional Life." Complex Systems 2 1988, pages 255-258. Carter Bays, "The Discovery of a New Glider for the Game of Three-dimensional Life." Complex Systems 4 1988, pages 599-602. Carter Bays, "Candidates for the Game of Life in Three Dimensions." Complex Systems 1 1987, pages 373-400. Carter Bays, "Patterns for Simple Cellular Automata in a Universe of Dense Packed Spheres." Complex Systems 1 1987, pages 853-875 Carter Bays, "Computer-Aided Advisement Language at the University of South Carolina." College and University Fall, 1984, Pages 32-37. Carter Bays and R. H. Hudson, "Cyclic Behavior of Primes the Arithmetic Progressions Modulo 11." Journal fur die Reine und Angewandte Mathematik, 1983. Pages 215-220. Carter Bays and Richard H. Hudson, "Numerical and Graphical Description of All of Axis Crossing Regions for the Moduli 4 and 8 Which Occur Before 10^13," International Journal of Math & Math Sci. 1979, Vol. 2, pages 111-119. Carter Bays and Richard Hudson, "The Appearance of Tens of Billion of Integers with pi(4,3) < pi(4,1) in the vicinity of 10^12" Journal fur die Reine und Angewandte Mathematik 1978, Pages 234-237. Carter Bays and Richard H. Hudson, "Details of the First Region of Integers With pi(3,2) < pi(3,1)." Mathematics of Computation April 1978, Vol. 32, No. 142, pages 571-576. Carter Bays and Richard H. Hudson, "On the Fluctuations of Littlewood for Primes of the Form pi(4,3,1) " Math. of Computation January 1978, Vol. 32, No. 141, pages 281-286. Carter Bays, "A Comparison of Next-fit, First-fit, and Best-fit." Communications of the ACM March 1977, Vol. 20, No. 3. Pages 191-192. Carter Bays and Richard H. Hudson, "The Segmented Sieve of Eratosthenes and Primes in Arithmetic Progressions to 10^13" BIT 17, 1977, 121-127. Carter Bays and Richard H. Hudson, "The Mean Behavior of Primes in Arithmetic Progressions." Journal fur die Reine und Angewandte Mathematik," 1977. Pages 80-99. Carter Bays, S.D. Durham, "Improving a Poor Random Number Generator." ACM Transactions on Mathematical Software March 1976, Vol. 2, No. 1, Pages 59-64. (* Note: the technique described in this paper is now a standard method for generating random numbers - Google: Bays Durham Shuffle, or Bays Shuffle.) Carter Bays, "An Animation Description Language." Computer Jour. Mar. 1976. Pages 1-8. Carter Bays, "A Non-recursive Technique for Recreating a Digraph from its K-formula Representation." The Computer Journal, June 1975, Vol. 19, No. 4. Pages 326-328. Carter Bays, "Some Techniques for Structuring Chained Hash Tables." The Computer Journal, April 1973, Vol. 16, No. 2. Pages 126-131. Carter Bays, " The Reallocation of Hash-Coded Tables." Communications of the ACM, January 1973, Vol. 16, No. 1. Pages 11-14. Carter Bays, "A Note on When To Chain Overflow Items Within a Direct-Access Table." Communications of the ACM, January 1973, Vol. 16, No. 1. Page 47.