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.
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 recordingApp development is ongoing and can be seen at the Redux website.
We have had several talented students involved in research in CCIL. If you're interested in joining, send an email to firstname.lastname@example.org. Please be aware that minimum requirements for hired research assistantships include:
Exceptions to these requirements may be granted in extenuating circumstances.
Previous CCIL Research Assistants: