ESP Biography



BEREN OGUZ, Loves CS and Math




Major: Computer Science / Math

College/Employer: UC Berkeley

Year of Graduation: 2019

Picture of Beren Oguz

Brief Biographical Sketch:

UC Berkeley freshman. Has a passion for both CS and Math, pursues an academic career to do research in Theoretical Computer Science. Fascinated by the Turing's proof of the Halting Problem. Is a Free Software Movement Supporter. Avid GNU/Linux user. Believes only in the Church of Emacs.



Past Classes

  (Look at the class archive for more.)


The Free Software Movement in Splash Spring 16
Philosophy and History behind the Free Software Movement. What is "Free Software"? Why is it very crucial for human societies, science, academia, freedom, anonymity, democracy and security? Why is it an inalienable part of the Free Culture Movement? Do we really need copyright laws? Why is the Open-Source Movement not enough or even dangerous? What are free alternatives to popular proprietary software? At the end of the class we will have a forum about why is proprietary software is still very common and whether it is harmful or beneficial. Historical background will be given at the beginning of the lecture, whereas the lecture will be mostly about philosophical justifications and sociological consequences of the Free Software Movement. Students shall expect a Philosophy/Sociology class.


Intro to Theoretical Computer Science and Category Theory in Splash Fall 15
An introduction to mathematical foundations of Computer Science. Course will first introduce logic and lambda calculus. And then it will continue with halting problem, computability and O notation. Church-Turing thesis and Turing Machines will be explained. "Is P equal to NP?" Then, we will discuss some discrete mathematics, such as graphs and the pigeonhole principle. At last we will start from Set Theory, develop it to Category Theory and talk about Type Theory. At this point we will use a functional programming language (such as Haskell or Idris) to demonstrate key ideas. If instructor finds time (and students are motivated) additional advanced materials such as Godel's incompleteness theorem, various non-persistent and persistent data structures or information theory might be introduced.