Paul Bodily About Courses Research Outreach Tips for Communicating Teaching Philosophy Vitae

Computational Creativity and Intelligence Lab (CCIL)

The Computational Creativity and Intelligence Lab (CCIL, pronounced like the name Cecil), led by Dr. Paul Bodily, is dedicated to conducting research in the fields of Computational Creativity (CC), Artificial Intelligence (AI), and Machine Learning (ML), as well as research in the area of Computational Theory, Formal Languages, and NP-Completeness Theory.

Computational Creativity, AI, and ML

Computational Creativity has been defined as "the philosophy, science and engineering of computational systems which, by taking on particular responsibilities, exhibit behaviours that unbiased observers would deem to be creative" (Simon Colton and Geraint A. Wiggins. Computational creativity: The final frontier? In Proceedings of the Twentieth European Conference on Artificial Intelligence, pages 21–26. IOS Press, 2012). In CCIL we emphasize the incorporation of ML and AI models in CC. Projects under development in this area in CCIL include:

Computational Theory, Formal Languages, and NP-Completeness Theory

In CCIL we have a strong interest in the practical application of implemented models to solving real-world problems. Many of the problems of interest we encounter have well-known analogs in the set of formal languages defined in computational theory (e.g., 3SAT, MAX-CUT, Traveling Salesperson, etc.). These problems (many of which are NP-complete) have broad applicability, and there are several well-established heuristic and approximation algorithms designed to address them. We are endeavoring to create the first crowd-sourced, interactive web-based knowledgebase of NP-complete problems, reductions, and solutions. Once complete, the knowledgebase will provide working implementations (complete with visualizations) of reduction and solution algorithms that users can apply to arbitrary problem instances. Our interest in this project is three-fold: its use as a pedagogical tool; meta-level research in the area of formal languages and NP-completeness (e.g., transivitity, use of AI for deriving reductions and solutions); and industrial application.

A great intro to the project is Kaden's Thesis defense: Zoom recording

App development is ongoing and can be seen at the Redux website.

Past and Prospective CCIL students

We have had several talented students involved in research in CCIL. If you're interested in joining, send an email to Please be aware that minimum requirements for hired research assistantships include:

  1. the student must have completed CS 2263 (or the equivalent) with a grade of at least a B.
  2. the student must have previously either taken a course with me or participated in mentored research with me for at least one semester.

Exceptions to these requirements may be granted in extenuating circumstances.

Previous CCIL Research Assistants:

  • Michael Crapse, BS Student, 2023-present
  • Russell Phillips, BS Student, 2023-present
  • Andrija Sevaljevic, BS Student, 2023-present
  • Show Pratoomratana, BS Student, 2022-2023
  • Alex Diviney, BS Student, 2022-2023
  • Daniel Igbokwe, BS Student, 2022-2023
  • Caleb Eardley, BS Student, 2022-2023
  • Kaden Marchetti, MS Student, 2021-2023
  • Delaney Moore, MS Student, 2021-2023
  • Garrett Stouffer, BS Student, 2022-2022
  • Janita Aamir, BS Student, 2020-2022
  • Andrew Christiansen, BS Student, 2020-2021
  • Brandon Biggs, MS Student, 2019-2022
  • Porter Glines, MS Student, 2019-2022
  • Hunter Harris, BS Student, 2019-2021