hahaha 
Talking cameras - these digital ones are a bit slow, therefore I was too fast, but I am learning.
Thats what the multi-shot feature is for!
ahh the digital binary world of 1s and 0s ... vaavaavaavoom!!
but what kind of digital approximation, what fineness of binary resolution will be enough to fool the human perception into believing it is the same as the infinite gradiation of the analog world? will technology ever make it possible? supposedly the new quantum computers will be able to not only operate in the binary world of 1s and 0s, or black and white - but instead be able to deal with almost infinite gradiations of grey between that "ON" or "OFF" state.. instead of 'bits' you have 'qubits'
A classical computer has a memory made up of bits, where each bit holds either a one or a zero. The device computes by manipulating those bits, i.e. by transporting these bits from memory to (possibly a suite of) logic gates and back. A quantum computer maintains a vector of qubits. A qubit can hold a one, a zero, or, crucially, a superposition of these. A quantum computer operates by manipulating those qubits, i.e. by transporting these bits from memory to (possibly a suite of) quantum logic gates and back.
An example of an implementation of qubits for a quantum computer would be the use of particles with two spin states: "up" and "down" (typically written |0\rangle and |1\rangle). But in fact any system possessing an observable quantity A which is conserved under time evolution and such that A has at least two discrete and sufficiently spaced consecutive eigenvalues, is a suitable candidate for implementing a qubit. That's because any such system can be mapped onto an effective spin-1/2.
Consider first a classical computer that operates on a 3 bit register. At any given time, the bits in the register are in a definite state, such as 101. In a quantum computer, however, the qubits can be in a superposition of all the classically allowed states. In fact, the register is described by a wavefunction:
where the coefficients α, β, γ,... are complex numbers whose amplitudes squared are the probabilities to measure the qubits in each state. Consequently, | γ |
2 is the probability to measure the register in the state 010. It is important that these numbers are complex, due to the fact that the phases of the numbers can constructively and destructively interfere with one another; this is an important feature for quantum algorithms.[3]
For an n qubit quantum register, recording the state of the register requires 2
n complex numbers (the 3-qubit register requires 2
3 = 8 numbers). Consequently, the number of classical states encoded in a quantum register grows exponentially with the number of qubits. For n=300, this is roughly 10
90, more states than there are atoms in the observable universe. Note that the coefficients are not all independent, since the probabilities must sum to 1. The representation is also (for most practical cases) non-unique, since there is no way to physically distinguish between a particular quantum register and a similar one where all of the amplitudes have been multiplied by the same phase such as −1, i, or in general any number on the complex unit circle. One can show the dimension of the set of states of an n qubit register is 2
n+1 − 2.
