Don Ihde called the hypothesis being 'hyped' and referred to clear evidence about the use of optical tools by, ., Albrecht Dürer and Leonardo da Vinci and others. As well the 1929 Encyclopædia Britannica  contains an extensive article on the camera obscura and cites Leon Battista Alberti as the first documented user of the device as early as 1437.  Ihde states abundant evidence for widespread use of various technical devices at least in the Renaissance and . in Early Netherlandish painting .  Jan van Eyck 's 1434 painting Arnolfini Portrait shows a convex mirror in the centre of the painting. Van Eyck also left his signature above this mirror,  showing the importance of the tool. The painting includes a crown glass window in the upper left side, a rather expensive luxury at the time. Van Eyck was rather fascinated by glass and its qualities, which was as well of high symbolic importance for his contemporaries.  Early optical instruments were comparatively expensive in the Medieval age and the Renaissance. 
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.