Papers for Euler Circle Theory of Computation, Fall 2022
Aashir Melhotra and Aript Mittal:
On the word problem on groups
Agastya Goel:
Computable functions
Anant Asthana:
The busy beaver problem
Ananya Sriram and Jisha Rajala:
Hilbert's tenth problem
Arav Bhattacharya:
Quantum computing: an introduction
Arindam Kulkarni:
Probabilistically checkable proofs
Brian Wu:
Hilbert's 10th problem
Eddy Li:
An exposition on Hilbert's tenth problem
Ekam Kaur:
PCP
Ezra Furtado-Tiwari:
Interactive proof systems
Grace Howard:
Cellular automata and the game of life
Jennifer Ren and Andrew Chang:
Quantum computing and algorithms
Jerry Guo:
Hashlife
Jonathan Xue:
Interactive proof systems
Joshua Koo:
Class BPP in probabilistic algorithms
Kaitlyn Zhang:
Cellular automata and the game of life
Krishna Praneeth Sidde and Saee Patil:
Hilbert's tenth problem
Maria Chrysafis:
Treaps
Nate Brown:
The word problem for groups
Nathan Wu:
Quantum algorithms and complexity classes
Neil Kolekar:
Automatic sequences and transcendental numbers
Roger Fan:
Quantum computing
Rohan Bodke, Andrew Tung, and Ekam Kaur:
Probabilistically checkable proofs and hardness of approximation
Steve Zhang:
Probabilistic and randomized algorithms
Zipeng Lin:
Probabilistic algorithm on Turing machine