Want this question answered?
1801. Joseph Marie Jacquard's mechanical loom took input in the form of punch cards laced together to form a chain and produced an output in the form of woven cloth. By any definition, Jacquard's "machine code" was arguably the first programming language as we know it today. Whether we regard a loom as being a computer or not is immaterial when discussing programming languages. 1833. Charles Babbage's Analytical Engine used a similar principal (punch cards) and although the device was never built, the design included the machine code necessary to program it. There was an attempt to fund construction of a working model in 2010 which failed to materialise. However, in 1991, another of his designs, Difference Engine No. 2 which evolved from his work on the earlier Difference Engine and Analytical Engine, was built and proved his designs were sound. Babbage is posthumously known as the "father of the computer" and it can easily be argued that his "machine code" was the first computer programming language. Of course we had analog computers long before Babbage. A slide-rule is a typical example. They were programmable in a sense, but whether we can call them programming languages is debatable.
I don't believe anyone suggested it, certainly no-one that could be named at least. Long before we had digital computers we had machines that were fully capable of processing binary information. The Jacquard loom is a prime example which pre-dates Charles Babbage's early computer designs. Although Babbage dabbled with decimal machines, even he saw the benefits of using binary; by far the simplest method of implementing a numeric system at the machine level.
The cfl's proved total efficiency.
no one
C is often referred to as a high level assembly language. There are few languages with less overhead (in terms of run-time support). When you are coding to meet certain constraints (performance, real-time time constraints, memory limitations, etc.), C can provide you with code that meets those constraints but which is also (relatively) portable. Note: Of course C and Assembly are not similar at all.
There is no such thing as a machine "capable of solving any problem".
davros
alan turning
Bill Gates
That sounds like the description of a Turing machine, which was a theoretical machine described by Alan Turing.
who nose unless u were born in them times
A hypothesis is a testable problem that can be proved or disproved.
It was actually the other way around.In 1936 in his paper titled "On Computable Numbers" he proved that there were problems that such a machine could notsolve.
The environmental problem is in fact obvious and proved making a lots of casualties
proved "the halting problem" was false.
1942
true