Solving Proof Block Problems Using Large Language Models
Seth Poulsen, Sami Sarsa, James E. Prather, Juho Leinonen, Brett A. Becker, Arto Hellas, Paul C. Denny, Brent N. Reeves · 2024
Large language models (LLMs) have recently taken many fields, including computer science, by storm. Most recent work on LLMs in computing education has shown that they are capable of solving most introductory programming (CS1) exercises, exam questions, Parsons problems, and several other types of exercises and questions. Some work has investigated the ability of LLMs to solve CS2 problems as well. However, it remains unclear how well LLMs fare against more advanced upper-division coursework, such as proofs in algorithms courses. After all, while known to be proficient in many programming tasks, LLMs have been shown to have more difficulties in forming mathematical proofs.