My name is Austin Jiang. I am nominating myself. I participated in the Wolfram High School Summer Research Program 2024 and the Wolfram Emerging Leaders Program HS 2024–2025. I also served as a student ambassador. In 2025, I was a teaching assistant for the Wolfram High School Summer Research Program and registered for the Wolfram Emerging Leaders Program U 2025–2026.
I am passionate about computer science, from theoretical computer science to computing olympiads, from creative computation to hackathons. In WSRP 2024, my research focused on constructing bitwise operators using SK combinators. This was not the original project assigned to me, but an idea that came to me after finishing my initial combinator task. I developed a new way to represent binary numbers using recursive nested pairs in SK combinators, which allowed me to define bitwise operations at the level of individual bits. I also built a direct two-way translation between this numeral structure and Church numerals using SK combinators. This made it possible to apply bitwise operators directly to Church numerals. Project link: https://community.wolfram.com/groups/-/m/t/3216997
I have continued this research over the past year. I applied Y combinators and Church numeral recursion to generalize bitwise operators to variable-length inputs within the combinator system itself. This work has strong theoretical value because SK combinators are equivalent to the lambda calculus. My structure allows Church numerals to support arbitrary map-depth and function composition in the lambda calculus. The research link is https://community.wolfram.com/groups/-/m/t/3520635.
When I was a teaching assistant at WSRP 2025, Stephen Wolfram signed my book with a handwritten message: “21st Century λ Combinator-ist.” 
I believe everything I accomplished was only possible because of the function repository in Wolfram Language. It allowed me to compile and evaluate SK combinators and lambda expressions without manually computing the entire structure, which would otherwise be intractable. This may explain why this area has very little prior research. I also contributed to the Wolfram Function Repository with my own function: https://resources.wolframcloud.com/FunctionRepository/resources/BinaryCombinator
In the Wolfram Emerging Leaders Program 2024–2025, I took a completely different project. I created a 3D printing infill generator using 3D cellular automata. Project link: https://community.wolfram.com/groups/-/m/t/3379925. While this lacks some sort of theoretical depth, it shows my application of Wolfram Language practically, innovatively, and creatively.
All of this connects to my deep interest in algorithms. As a two-time national top 10 finalist in the Canadian Computing Olympiad, I view algorithms not just as problem-solving tools but as creative structures. In a recent national hackathon, I designed a new memory modeling algorithm that simulates human knowledge for personalized learning and memory planning.
With Wolfram Language, I can make everything true.
