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. 
Be sure to choose only the arguments you will be able to illustrate and develop in your essay. Feel free to revisit your thesis statement and rewrite it while you work on your paper and want to add or change something. If you decide to use the thesis statement suggested above, you will need to write one paragraph discussing a relationship between literacy of population and economic development of the country. Another paragraph should shed light on the current situation in Africa. Try to find the latest stats on education and economy in Africa. Numbers often speak louder than words when you need to illustrate your point and to persuade readers to share your position. The third paragraph should address the question of humanitarian aid and the attitude of the locals to it. Finally, make sure to repeat your thesis statement in the conclusion part, but use different wording.