"About me:

=========

I teach

(1) *Theory of Computation*

(a) Automata Theory: DFA, NFA, regular language, pumping lemma for regular languages, prove some languages are not regular; CFL, CFG, Pushdown automata;

(b) Computability Theory: Turing Machines, how Turing machines work; decidable and undecidable languages; the halting problem; the general reducibility and mapping reducibility technique; Rice's theorem for proving undecidability; prove some languages are undecidable using prove by contradiction, using reducibility methods, or via Rice's theorem.

-------------------

I have a B.S in Math, and a Ph.D in computer science (from the University of Rochester in 2010, my major was AI). I worked or interned at Yahoo (2005), Google (2007, 2008), Amazon (2010-2013), Facebook (2017-2018), and eBay (Now). I have 10+ years of coding experiences, and 10+ years industry experiences in applying machine learning to real world problems.

In the recent 10 years, my daily work includes data processing (Pandas, matplotlib, Mapreduce, Hadoop, Spark, and PySpark, etc), model building (Scikit-learn, Pytorch, TensorFlow), model evaluation, and deployment (PySpark).

Cancellation policy:

================

24 hours ahead

Rates:

=====

$100/h

For students and professionals: if your only goal is to ask me to do your work, but not want to understand it, that is a waste of time of yours and mine. Please do not contact me for such request. Thanks." less...