UNIVERSITY OF SOUTH FLORIDA
Department of Mathematics
Abbreviated Curriculum Vita

I. POSITIONS:

II. EDUCATION:

Ph.D. in Mathematics (Foundations, Analysis, and Computer Science) from the University of Wisconsin, Madison, Wisconsin, in December 1975.

Doctoral Dissertation Topic: Independence Results in Recursive Set Theory With Applications in Higher Order Logic.

B.S. in Mathematics and Physics from the University of Kentucky, Lexington. Graduate study in: mathematical logic, mathematical analysis, model theory, and theoretical computer science.

Other education: Chairing an Academic Department (3 days, Florida State University at Mission Inn Resort, October 1994), Writing Winning Grants (1 day, USF, 21 October 1993), Active Learning Workshop (2 weeks, USF, Summer 1992), Molecular Cell Biology (USF, Fall 1991), Microprocessor Design and Programming (AT&T Bell Laboratories, 1986), Contemporary Electronics (McGraw-Hill Continuing Education Center, 1985), EEL 6764 -- Principles of Computer Architecture (USF, 1983), AMS Short Course in Statistics (San Antonio, 1980).

III. AREAS OF RESEARCH:

Analytic, logical, and algebraic theory of parallel computation and distributed processes; random and asychronous packet switching networks; asynchronous cellular automata, biological information processing; mathematical logic; algebra.

IV. PUBLICATIONS, ETC.:

My primary area of research involves the development of algebraic, logical, topological and analytic tools for the analysis and synthesis of parallel computations and distributed processes, especially as seen in biological information processing. My primary achievement in recent years is the development of tractable mathematics for investigating the global behavior of asynchronous cellular automata---a problem dating back 30 years to J. VonNeumann and S. Ulam.

Textbook:

LISP, Lore and Logic, by Springer-Verlag, New York and Berlin. February 1990. Most LISP texts focus on its use in artificial intelligence. This advanced mathematics/computer science text is the first to focus on LISP's mathematical foundations--the source of its exceptional power. To an extent, I developed LISP as Professor McCarthy originally conceived it--as a computer language implementing recursion theory.

Articles in refereed publications:

A forcing approach to st∏₁¹ reflection and st∏₁¹=∑₁⁰, Zeitsch. math. Logik u. Grundlagen d. math., Vol. 24, No. 5, pp. 467-479, 1978.

Type heirarchies and type level reduction, Cybernetica, Vol. 22, No. 5, pp. 17-31, 1979. Supported by NSF 3610180450.

A measure of subgroup diversity, Journal of Algebra, Vol. 61, No. 2, 1979.

Martin's axiom in the model theory of L_A, Journal of Symbolic Logic, Vol. 45, No. 1, pp. 172-86, 1980.

Automatic model construction. Information Sciences, Vol. 22, No. 2, pp. 90-102, 1980.

Logics of knowledge, Zeitsch. math. Logik u. Grundlagen d. math., Vol. 27, No. 2, 1981.

Homeostasis in synchronous distributed computations: a formal view. Information Sciences, pp. 151-69, Vol. 30, No. 4, 1983. (CP p. 190, April 1986).

A glimpse into the paradise of combinatory algebra, International Journal of Computer and Information Sciences, Vol. 13, No. 3, 1984.

Parameterized models of distributed processes. Cybernetica, Vol. 27, No. 4, 1984.

A parallel minimum spanning tree algorithm in LISP (with Dr. Leon Kotin). Presented to the 16th International Conference on Combinatorics, Graph Theory and Computing. Published in Congressus Numeratium, Vol. 58, 1985.

Logic Programming (a refereed technical correspondence). Communications of the ACM, p. 331, Vol. 29, No. 4, April 1986.

Thoughts on mechanical societies: or distributed processing in a random and changing environment (with Leon Kotin). Presented to the 17th International Conference on Combinatorics, Graph Theory, and Computing. Published in 1987 by Congressus Numeratium, Vol. 60, pp. 221-242.

A logic for distributed processes. Zeitsch. math. Logik u. Grundlagen d. math., Vol. 35, No. 4, August 1989.

The traveling salesman problem: some approximate algorithms (with Leon Kotin). Presented at the 19th International Conference on Combinatorics, Graph Theory and Computing (1988). August 1989 in Congressus Numeratium.

The social metaphor for distributed processing. Journal of Parallel and Distributed Computing, Vol. 6, No. 4, August 1989.

Terribly technical writing. Chapter 6 of Writing and Publishing for Academic Authors, University Presses of America, 1992, New York.

On the complexity of deadlock-free programs on a ring of processors (with Edwin Clark and Greg McColm). J. of Parallel and Dristributed Computing, Vol. 16, 1992 (all three authors shared the credit for this item equally).

Tissue models, with programming problems from God's Notebook. A.C.M. Special Interest Group in Biological Information Processing, 1992.

Artificial Tissue. Chapter 12 in the book Computing with Biological Metaphors, (Edited by R. Paton), published by Chapman & Hall, London, 1994.

Mathematics for a Fundamental Problem in Biological Information Processing (with computer programming by Dr. John Pedersen), accepted, IEEE International Conf. on Intelligence in Neural and Biological Systems, Washington, D.C., 29 May 1995.

Asynchronous, irregular automata nets: the path not taken (with Bill Hughes, student). BioSystems, v. 55, pp. 107-117, Spring 2000.

Dynamics for a Fundamental Problem of Biological Information Processing, Journal of Artificial Intelligence Tools, Spring 1996.

Graph Isomorphisms and the Evolution of Cooperation (with J. Pedersen and S. Suen), The Boca Raton Combinatorics and Graph Theory Conf., March 1994.

Research papers accepted for publication:

f′ = f o f (with Igor Skrypnik), East-West J. of Mathematics, Hue Univ., VIETNAM, 2001.

V. INVITED SPEECHES/PRESENTED PAPERS/CONFERENCE ORGANIZATION:

An Analytical Approach to Asynchronous Processes, (NATO) International Workshop on Cells and Tissue Modeling in Mathematics, Indianapolis, August 1999.

Ulam's Asynchronous Cellular Automata Problem -- a Solution, Pacific Rim Conference on Mathematics, City University of Hong Kong, 20 January 1998.

Asynchronous Automata Nets as an Artificial Tissue Model, invited colloquium talk, Chinese University of Hong Kong, 22 January 1998.

Abstract Dynamics for a Problem in Biology, International Conference on Nonlinear Differential Equations and Dynamics, Kiev, August 1995.

Mathematics for a Fundamental Problem in Biological Information Processing, with John Pedersen, accepted, IEEE International Conf. on Intelligence in Neural and Biological Systems, Washington, D.C., 29 May 1995. Voted to be one of the six best papers presented.

International Workshop on Information Processing in Cells and Tissues, Liverpool, 8 September 1995.

Graph isomorphism and the evolution of cooperation, by Pedersen, Suen and Stark, Graph Theory Conference, Boca Raton, 1994.

Topological methods for the analysis of distributed processes, Mathematics & Computer Science Departments, SUNY Binghamton, March 1993. A colloquium talk.

Algebraic Tissue -- A mathematical model, invited 1-hour featured presentation at the 2nd Annual Ulam Mathematics Conference, Palm Beach, 4 April 1991. A tutorial on artificial life, with David Jefferson (UCLA), invited 3½-hour tutorial at IBM, Tampa, 21 March 1991.

A topological approach to proving properties of asynchronous distributed computations, at the “Mathematical Issues in Biologically Motivated Computing,” Special Session of the AMS Conference, Tampa, 23 March 1991.

LDP: A Logic for distributed processes, presented to Southeastern Logic Symposium, Miami Beach, March 1990.

The traveling salesman problem: some approximate algorithms, (delivered by Kotin, co-authored by Stark); presented to the 19th International Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, February 1988.

Thoughts on mechanical societies: or distributed computing in random and changing architectures, (delivered by Stark, co-authored with Dr. Leon Kotin); presented to the 17th International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, February 1986.

Types of distributed processes, invited talk given to the Mathematics Department of Stephens Institute of Technology, November 1985.

A parallel minimum spanning tree algorithm in LISP, (delivered by Stark, co-authored with Dr. Leon Kotin); presented to the 16th International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, February 11-15, 1985.

Abstract algebra in theoretical science. An invited presentation to the Mathematics Department of Stetson University, DeLand, Florida, 1983.

LISP and functional computing. An invited talk for the IEEE Computer Society (South Florida chapter), Tampa, 1983.

An application of Martin's Axiom in group theory. A paper presented to the 83rd Annual Convention of the American Mathematical Society, St. Louis, 1977.

Automatic construction of finite models. A paper presented to the 84th Annual Convention of the American Mathematical Society, Atlanta, 1978.

A decision procedure for the logic of knowledge. An invited presentation at the Stanford Artificial Intelligence Laboratory, Stanford University, 1978.

Hilbert's program and the controversy in the foundations of mathematics. An invited presentation to the Mathematics Department of Stephen F. Austin State University, 1976.

Göedel's theorem and unsolvable problems in mathematics. An invited presentation at Texas Christian University, 1976.

A new compactness theorem for infinitary logic. A paper presented to the 81st Annual Convention of the American Mathematical Society, Washington, D.C., 1975.

St∏₁¹ analysis and its application in logic, an invited special session presentation to the 80th Annual Convention of the American Mathematical Society, San Francisco, 1974.

VI. OTHER CREATIVE ACTIVITY:

Program Development:

Beyond teaching and research, my assigned mission at USF was originally to develop a Theory of Computation program in the Mathematics Department. By Theory of Computation, I mean the heavily mathematical half of Theoretical Computer Science. Using this definition, Theory of Computation stands in relation to Computer Science as classical Applied Mathematics stands to Physics and Engineering.

The mathematics that is involved is advanced discrete mathematics, in particular: abstract algebra, mathematical logic, recursion theory, complexity theory, set theory, graph theory, combinatorics, number theory, coding theory, and linear algebra. The importance of discrete mathematics to Computer Science is a natural consequence of two things: (1) the digital (and therefore discrete) nature of modern computation; and (2) the central role of syntax and semantics in computer science, algebra(s) and mathematical logic. With increasing frequency computer science's deepest and most exciting problems have been solved using techniques from these areas of mathematics.

Toward the development of Theory of Computation as an applied mathematics for Computer Science, I have: (1) created new courses (listed below); (2) worked (successfully) to add new faculty members (Drs. McColm, Pedersen and Jonoska) specializing in logic, algebra, and the theory of computation to the existing faculty (Professor Clark, Professor Liang, and myself); (3) reorganized and expanded the existing offering in the foundations of mathematics and computation into a strong new program; and (4) publicized the program. Further support to the Theory of Computation program was achieved this spring when the Department approved Logic and Foundations as one of the four main streams of graduate education in Mathematics (along with Analysis, Topology and Geometry, Differential Equations, Dynamics and Control, and Probability and Statistics). This supports the ``Theory of Computation'' program by moving its classes into the Department's mainstream.

Theory of Computation is growing rapidly in its importance to Mathematics and Computer Science, in marketability, and in graduate student interest. We have, over the last ten years, increased the size, strength and productivity of this program to the level of national visibility. We are working to coordinate our program with the Department of Computer Science. Our program now (Fall 1993) consists of seven faculty members and is the largest in the state.

VII. DEPARTMENT, COLLEGE, AND PROFESSIONAL SERVICE:

Course Development:

MAT 5932 Complex (Information Processing) Systems -- Theory and Models, 1996.

Perspectives in Modern Mathematics: Applications of the Imagination and of Personal Computers to High School Mathematics and Science (USF, Lakeland, 1989-…).

MAD 3100 Applications-Oriented Algebra, 1983.

MAT 5932 Logic and Foundations, 1991.

MAT 5932 Mathematical Models for Parallel and Distributed Computing, 1988.

MAD 5101 LISP Programming With Algebraic Applications (offered yearly since 1979).

Neural Networks and Distributed Processing, offered 1987-88.

MAT 5932 Mathematical Logic and Foundations I (restructured 1991).

MAT 6507 Mathematical Logic and Foundations II (restructured 1991).

Course development Group Problem Solving in Mathematics and Science for secondary school teachers in 1988, '89, '90 at USF (Lakeland).

COP 4215 Mathematical Problem Solving Using PASCAL, 1985.

Refereeing for:

Mathematical Systems Theory (Editor: Professor S. Evan), 1997.

International Workshop for Information Processing in Cells and Tissues, at The University of Liverpool, September 1995, 1997.

ACM SIGBIO (Editor: Ray Paton, Univ. of Liverpool)

Academic Press (Elaine Wigzell)

Chapman & Hall (Dr. Susan King)

Information and Control (Editor of Information and Computation, Albert Meyer, MIT, 1980-98)

IEEE Computing Transactions (Editor: Oscar Garcia, USF)

IEEE Computer Society (Editor: Virgil Kilgore, Univ. of Maryland)

Journal of Intelligent Systems (Editor: M. McGuire of Wiley)

International Journal of Computer and Information Science (Editor: Julius Tou, Univ. of Florida)

Reviewing regularly since 1979 for:

Mathematical Reviews and Computing Reviews.

VIII. GRADUATE STUDENTS:

Doctoral Students (1987-…):

I am/was a member of the Ph.D. Committees of:

Wes Skinner (Mathematics)
Nabeil Al-Madana (Computer Science)
Raghn Sastry (Computer Science)
Ruiming Zhang (Mathematics)
Paulo Bobreck (Computer Science)
Joo Young-do (Computer Science)
Wayne Pollack (Computer Science)
Alok Chaturvedi (Computer Science)
Margaret Yoder (Mathematics)
Tony Chang (Mathematics)
Yun-Sik Lee (Computer Science)

Doctoral Students Before 1991 (Member of Committee):

I was on the Ph.D. Committee of each of these students:

Qing Zhao (Mathematics)
Gongyuan Yao (Mathematics)
Cindy Sarmento (Computer Science)
John McNally (Computer Science)
Amir Abou-El-Naga (Computer Science)
Paul Higgins (Mathematics)
Kim Moon (Computer Science)
Ron Vogelsong (Engineering)
Seung Yang (Computer Science)
Jae You (Computer Science)
Charles Wells (Computer Science)

Master's Degree Students in Mathematics:

Wes Skinner (1991)
Tina Tremmel (1991)
David Devine (1989)
Gabor Belovari (1984)
Kevin Schweiker
Ruth Guthrie
Stephen Pettit
Theodore Netterfield
Rajiv Dholakia
Kurt Long

Master's Degree Students in other departments:

Adam Williams (Biology) (1998-99)