The word 'efficiently' here means up to polynomial-time reductions . This thesis was originally called Computational Complexity-Theoretic Church–Turing Thesis by Ethan Bernstein and Umesh Vazirani (1997). The Complexity-Theoretic Church–Turing Thesis, then, posits that all 'reasonable' models of computation yield the same class of problems that can be computed in polynomial time. Assuming the conjecture that probabilistic polynomial time ( BPP ) equals deterministic polynomial time ( P ), the word 'probabilistic' is optional in the Complexity-Theoretic Church–Turing Thesis. A similar thesis, called the Invariance Thesis , was introduced by Cees F. Slot and Peter van Emde Boas. It states: "Reasonable" machines can simulate each other within a polynomially bounded overhead in time and a constant-factor overhead in space .  The thesis originally appeared in a paper at STOC '84, which was the first paper to show that polynomial-time overhead and constant-space overhead could be simultaneously achieved for a simulation of a Random Access Machine on a Turing machine. 
Students from both our undergraduate and graduate programs have successfully entered many different professional and academic programs and careers. While some have transitioned directly into mathematical . programs, others have taken jobs in business (consulting and actuarial), education (both college and secondary education), industry (analysts and various computing activities), or government agencies (National Security Agency). Still others have entered professional programs in medicine, business and law or graduate programs in statistics, biostatistics, or operations research.
If the student has explored all other options and still wish to change supervisors, he or she should talk to the graduate program director. If the supervisor happens to be the graduate program director, the student should talk to the chair of the academic unit. If the student remains uncertain or dissatisfied, he or she should talk to the vice-dean graduate studies of his/her home faculty. Beyond that, the student can talk to the university ombudsperson. The student can request that the exchanges with any or all of these individuals (directors, vice-dean, ombudsperson) remain confidential.