document_title: Computer

question_text: when were the first computers invented and used

question_tokens: when were the first computers invented and used

text: Computer

text: Etymology

text: According to the Oxford English Dictionary, the first known use of the word "computer" was in 1613 in a book called The Yong Mans Gleanings by English writer Richard Braithwait: "I haue [sic] read the truest computer of Times, and the best Arithmetician that euer [sic] breathed, and he reduceth thy dayes into a short number." This usage of the term referred to a person who carried out calculations or computations. The word continued with the same meaning until the middle of the 20th century. From the end of the 19th century the word began to take on its more familiar meaning, a machine that carries out computations.[1]

text: The Online Etymology Dictionary gives the first attested use of "computer" in the "1640s, [meaning] "one who calculates,"; this is an "... agent noun from compute (v.)". The Online Etymology Dictionary states that the use of the term to mean "calculating machine" (of any type) is from 1897." The Online Etymology Dictionary indicates that the "modern use" of the term, to mean "programmable digital electronic computer" dates from "... 1945 under this name; [in a] theoretical [sense] from 1937, as Turing machine".[2]

text: History

text: Pre-20th century

text: Devices have been used to aid computation for thousands of years, mostly using one-to-one correspondence with fingers. The earliest counting device was probably a form of tally stick. Later record keeping aids throughout the Fertile Crescent included calculi (clay spheres, cones, etc.) which represented counts of items, probably livestock or grains, sealed in hollow unbaked clay containers.[3][4] The use of counting rods is one example.

text: The abacus was initially used for arithmetic tasks. The Roman abacus was developed from devices used in Babylonia as early as 2400 BC. Since then, many other forms of reckoning boards or tables have been invented. In a medieval European counting house, a checkered cloth would be placed on a table, and markers moved around on it according to certain rules, as an aid to calculating sums of money.

text: The Antikythera mechanism is believed to be the earliest mechanical analog "computer", according to Derek J. de Solla Price.[5] It was designed to calculate astronomical positions. It was discovered in 1901 in the Antikythera wreck off the Greek island of Antikythera, between Kythera and Crete, and has been dated to circa 100 BC. Devices of a level of complexity comparable to that of the Antikythera mechanism would not reappear until a thousand years later.

text: Many mechanical aids to calculation and measurement were constructed for astronomical and navigation use. The planisphere was a star chart invented by Abū Rayhān al-Bīrūnī in the early 11th century.[6] The astrolabe was invented in the Hellenistic world in either the 1st or 2nd centuries BC and is often attributed to Hipparchus. A combination of the planisphere and dioptra, the astrolabe was effectively an analog computer capable of working out several different kinds of problems in spherical astronomy. An astrolabe incorporating a mechanical calendar computer[7][8] and gear-wheels was invented by Abi Bakr of Isfahan, Persia in 1235.[9] Abū Rayhān al-Bīrūnī invented the first mechanical geared lunisolar calendar astrolabe,[10] an early fixed-wired knowledge processing machine[11] with a gear train and gear-wheels,[12] circa 1000 AD.

text: The sector, a calculating instrument used for solving problems in proportion, trigonometry, multiplication and division, and for various functions, such as squares and cube roots, was developed in the late 16th century and found application in gunnery, surveying and navigation.

text: The planimeter was a manual instrument to calculate the area of a closed figure by tracing over it with a mechanical linkage.

text: The slide rule was invented around 1620–1630, shortly after the publication of the concept of the logarithm. It is a hand-operated analog computer for doing multiplication and division. As slide rule development progressed, added scales provided reciprocals, squares and square roots, cubes and cube roots, as well as transcendental functions such as logarithms and exponentials, circular and hyperbolic trigonometry and other functions. Aviation is one of the few fields where slide rules are still in widespread use, particularly for solving time–distance problems in light aircraft. To save space and for ease of reading, these are typically circular devices rather than the classic linear slide rule shape. A popular example is the E6B.

text: In the 1770s Pierre Jaquet-Droz, a Swiss watchmaker, built a mechanical doll (automata) that could write holding a quill pen. By switching the number and order of its internal wheels different letters, and hence different messages, could be produced. In effect, it could be mechanically "programmed" to read instructions. Along with two other complex machines, the doll is at the Musée d'Art et d'Histoire of Neuchâtel, Switzerland, and still operates.[13]

text: The tide-predicting machine invented by Sir William Thomson in 1872 was of great utility to navigation in shallow waters. It used a system of pulleys and wires to automatically calculate predicted tide levels for a set period at a particular location.

text: The differential analyser, a mechanical analog computer designed to solve differential equations by integration, used wheel-and-disc mechanisms to perform the integration. In 1876 Lord Kelvin had already discussed the possible construction of such calculators, but he had been stymied by the limited output torque of the ball-and-disk integrators.[14] In a differential analyzer, the output of one integrator drove the input of the next integrator, or a graphing output. The torque amplifier was the advance that allowed these machines to work. Starting in the 1920s, Vannevar Bush and others developed mechanical differential analyzers.

text: First computing device

text: Charles Babbage, an English mechanical engineer and polymath, originated the concept of a programmable computer. Considered the "father of the computer",[15] he conceptualized and invented the first mechanical computer in the early 19th century. After working on his revolutionary difference engine, designed to aid in navigational calculations, in 1833 he realized that a much more general design, an Analytical Engine, was possible. The input of programs and data was to be provided to the machine via punched cards, a method being used at the time to direct mechanical looms such as the Jacquard loom. For output, the machine would have a printer, a curve plotter and a bell. The machine would also be able to punch numbers onto cards to be read in later. The Engine incorporated an arithmetic logic unit, control flow in the form of conditional branching and loops, and integrated memory, making it the first design for a general-purpose computer that could be described in modern terms as Turing-complete.[16][17]

text: The machine was about a century ahead of its time. All the parts for his machine had to be made by hand — this was a major problem for a device with thousands of parts. Eventually, the project was dissolved with the decision of the British Government to cease funding. Babbage's failure to complete the analytical engine can be chiefly attributed to difficulties not only of politics and financing, but also to his desire to develop an increasingly sophisticated computer and to move ahead faster than anyone else could follow. Nevertheless, his son, Henry Babbage, completed a simplified version of the analytical engine's computing unit (the mill) in 1888. He gave a successful demonstration of its use in computing tables in 1906.

text: Analog computers

text: During the first half of the 20th century, many scientific computing needs were met by increasingly sophisticated analog computers, which used a direct mechanical or electrical model of the problem as a basis for computation. However, these were not programmable and generally lacked the versatility and accuracy of modern digital computers.[18] The first modern analog computer was a tide-predicting machine, invented by Sir William Thomson in 1872. The differential analyser, a mechanical analog computer designed to solve differential equations by integration using wheel-and-disc mechanisms, was conceptualized in 1876 by James Thomson, the brother of the more famous Lord Kelvin.[14]

text: The art of mechanical analog computing reached its zenith with the differential analyzer, built by H. L. Hazen and Vannevar Bush at MIT starting in 1927. This built on the mechanical integrators of James Thomson and the torque amplifiers invented by H. W. Nieman. A dozen of these devices were built before their obsolescence became obvious. By the 1950s the success of digital electronic computers had spelled the end for most analog computing machines, but analog computers remained in use during the 1950s in some specialized applications such as education (control systems) and aircraft (slide rule).

text: Digital computers

text: It has been suggested that this section be split out into another article titled Digital computer. (Discuss) (May 2017)

text: Electromechanical

text: By 1938 the United States Navy had developed an electromechanical analog computer small enough to use aboard a submarine. This was the Torpedo Data Computer, which used trigonometry to solve the problem of firing a torpedo at a moving target. During World War II similar devices were developed in other countries as well.

text: Early digital computers were electromechanical; electric switches drove mechanical relays to perform the calculation. These devices had a low operating speed and were eventually superseded by much faster all-electric computers, originally using vacuum tubes. The Z2, created by German engineer Konrad Zuse in 1939, was one of the earliest examples of an electromechanical relay computer.[19]

text: In 1941, Zuse followed his earlier machine up with the Z3, the world's first working electromechanical programmable, fully automatic digital computer.[20][21] The Z3 was built with 2000 relays, implementing a 22 bit word length that operated at a clock frequency of about 5–10 Hz.[22] Program code was supplied on punched film while data could be stored in 64 words of memory or supplied from the keyboard. It was quite similar to modern machines in some respects, pioneering numerous advances such as floating point numbers. Rather than the harder-to-implement decimal system (used in Charles Babbage's earlier design), using a binary system meant that Zuse's machines were easier to build and potentially more reliable, given the technologies available at that time.[23] The Z3 was Turing complete.[24][25]

text: Vacuum tubes and digital electronic circuits

text: Purely electronic circuit elements soon replaced their mechanical and electromechanical equivalents, at the same time that digital calculation replaced analog. The engineer Tommy Flowers, working at the Post Office Research Station in London in the 1930s, began to explore the possible use of electronics for the telephone exchange. Experimental equipment that he built in 1934 went into operation five years later, converting a portion of the telephone exchange network into an electronic data processing system, using thousands of vacuum tubes.[18] In the US, John Vincent Atanasoff and Clifford E. Berry of Iowa State University developed and tested the Atanasoff–Berry Computer (ABC) in 1942,[26] the first "automatic electronic digital computer".[27] This design was also all-electronic and used about 300 vacuum tubes, with capacitors fixed in a mechanically rotating drum for memory.[28]

text: During World War II, the British at Bletchley Park achieved a number of successes at breaking encrypted German military communications. The German encryption machine, Enigma, was first attacked with the help of the electro-mechanical bombes. To crack the more sophisticated German Lorenz SZ 40/42 machine, used for high-level Army communications, Max Newman and his colleagues commissioned Flowers to build the Colossus.[28] He spent eleven months from early February 1943 designing and building the first Colossus.[29] After a functional test in December 1943, Colossus was shipped to Bletchley Park, where it was delivered on 18 January 1944[30] and attacked its first message on 5 February.[28]

text: Colossus was the world's first electronic digital programmable computer.[18] It used a large number of valves (vacuum tubes). It had paper-tape input and was capable of being configured to perform a variety of boolean logical operations on its data, but it was not Turing-complete. Nine Mk II Colossi were built (The Mk I was converted to a Mk II making ten machines in total). Colossus Mark I contained 1,500 thermionic valves (tubes), but Mark II with 2,400 valves, was both 5 times faster and simpler to operate than Mark I, greatly speeding the decoding process.[31][32]

text: The U.S.-built ENIAC[33] (Electronic Numerical Integrator and Computer) was the first electronic programmable computer built in the US. Although the ENIAC was similar to the Colossus, it was much faster, more flexible, and it was Turing-complete. Like the Colossus, a "program" on the ENIAC was defined by the states of its patch cables and switches, a far cry from the stored program electronic machines that came later. Once a program was written, it had to be mechanically set into the machine with manual resetting of plugs and switches.

text: It combined the high speed of electronics with the ability to be programmed for many complex problems. It could add or subtract 5000 times a second, a thousand times faster than any other machine. It also had modules to multiply, divide, and square root. High speed memory was limited to 20 words (about 80 bytes). Built under the direction of John Mauchly and J. Presper Eckert at the University of Pennsylvania, ENIAC's development and construction lasted from 1943 to full operation at the end of 1945. The machine was huge, weighing 30 tons, using 200 kilowatts of electric power and contained over 18,000 vacuum tubes, 1,500 relays, and hundreds of thousands of resistors, capacitors, and inductors.[34]

text: Modern computers

text: Concept of modern computer

text: The principle of the modern computer was proposed by Alan Turing in his seminal 1936 paper,[35] On Computable Numbers. Turing proposed a simple device that he called "Universal Computing machine" and that is now known as a universal Turing machine. He proved that such a machine is capable of computing anything that is computable by executing instructions (program) stored on tape, allowing the machine to be programmable. The fundamental concept of Turing's design is the stored program, where all the instructions for computing are stored in memory. Von Neumann acknowledged that the central concept of the modern computer was due to this paper.[36] Turing machines are to this day a central object of study in theory of computation. Except for the limitations imposed by their finite memory stores, modern computers are said to be Turing-complete, which is to say, they have algorithm execution capability equivalent to a universal Turing machine.

text: Stored programs

text: Early computing machines had fixed programs. Changing its function required the re-wiring and re-structuring of the machine.[28] With the proposal of the stored-program computer this changed. A stored-program computer includes by design an instruction set and can store in memory a set of instructions (a program) that details the computation. The theoretical basis for the stored-program computer was laid by Alan Turing in his 1936 paper. In 1945 Turing joined the National Physical Laboratory and began work on developing an electronic stored-program digital computer. His 1945 report "Proposed Electronic Calculator" was the first specification for such a device. John von Neumann at the University of Pennsylvania also circulated his First Draft of a Report on the EDVAC in 1945.[18]

text: The Manchester Small-Scale Experimental Machine, nicknamed Baby, was the world's first stored-program computer. It was built at the Victoria University of Manchester by Frederic C. Williams, Tom Kilburn and Geoff Tootill, and ran its first program on 21 June 1948.[37] It was designed as a testbed for the Williams tube, the first random-access digital storage device.[38] Although the computer was considered "small and primitive" by the standards of its time, it was the first working machine to contain all of the elements essential to a modern electronic computer.[39] As soon as the SSEM had demonstrated the feasibility of its design, a project was initiated at the university to develop it into a more usable computer, the Manchester Mark 1.

text: The Mark 1 in turn quickly became the prototype for the Ferranti Mark 1, the world's first commercially available general-purpose computer.[40] Built by Ferranti, it was delivered to the University of Manchester in February 1951. At least seven of these later machines were delivered between 1953 and 1957, one of them to Shell labs in Amsterdam.[41] In October 1947, the directors of British catering company J. Lyons & Company decided to take an active role in promoting the commercial development of computers. The LEO I computer became operational in April 1951[42] and ran the world's first regular routine office computer job.

text: Transistors

text: The bipolar transistor was invented in 1947. From 1955 onwards transistors replaced vacuum tubes in computer designs, giving rise to the "second generation" of computers. Compared to vacuum tubes, transistors have many advantages: they are smaller, and require less power than vacuum tubes, so give off less heat. Silicon junction transistors were much more reliable than vacuum tubes and had longer, indefinite, service life. Transistorized computers could contain tens of thousands of binary logic circuits in a relatively compact space.

text: At the University of Manchester, a team under the leadership of Tom Kilburn designed and built a machine using the newly developed transistors instead of valves.[43] Their first transistorised computer and the first in the world, was operational by 1953, and a second version was completed there in April 1955. However, the machine did make use of valves to generate its 125 kHz clock waveforms and in the circuitry to read and write on its magnetic drum memory, so it was not the first completely transistorized computer. That distinction goes to the Harwell CADET of 1955,[44] built by the electronics division of the Atomic Energy Research Establishment at Harwell.[44][45]

text: Integrated circuits

text: The next great advance in computing power came with the advent of the integrated circuit. The idea of the integrated circuit was first conceived by a radar scientist working for the Royal Radar Establishment of the Ministry of Defence, Geoffrey W.A. Dummer. Dummer presented the first public description of an integrated circuit at the Symposium on Progress in Quality Electronic Components in Washington, D.C. on 7 May 1952.[46]

text: The first practical ICs were invented by Jack Kilby at Texas Instruments and Robert Noyce at Fairchild Semiconductor.[47] Kilby recorded his initial ideas concerning the integrated circuit in July 1958, successfully demonstrating the first working integrated example on 12 September 1958.[48] In his patent application of 6 February 1959, Kilby described his new device as "a body of semiconductor material ... wherein all the components of the electronic circuit are completely integrated".[49][50] Noyce also came up with his own idea of an integrated circuit half a year later than Kilby.[51] His chip solved many practical problems that Kilby's had not. Produced at Fairchild Semiconductor, it was made of silicon, whereas Kilby's chip was made of germanium.

text: This new development heralded an explosion in the commercial and personal use of computers and led to the invention of the microprocessor. While the subject of exactly which device was the first microprocessor is contentious, partly due to lack of agreement on the exact definition of the term "microprocessor", it is largely undisputed that the first single-chip microprocessor was the Intel 4004,[52] designed and realized by Ted Hoff, Federico Faggin, and Stanley Mazor at Intel.[53]

text: Mobile computers become dominant

text: With the continued miniaturization of computing resources, and advancements in portable battery life, portable computers grew in popularity in the 2000s.[54] The same developments that spurred the growth of laptop computers and other portable computers allowed manufacturers to integrate computing resources into cellular phones. These so-called smartphones and tablets run on a variety of operating systems and have become the dominant computing device on the market, with manufacturers reporting having shipped an estimated 237 million devices in 2Q 2013.[55]

text: Types

text: Computers are typically classified based on their uses:

text: Based on uses

text:
Analog computer
Digital computer
Hybrid computer

text: Based on sizes

text:
Smartphone
Micro computer
Personal computer
Laptop
Minicomputer
Mainframe computer
Super computer

text: Hardware

text: The term hardware covers all of those parts of a computer that are tangible physical objects. Circuits, computer chips, graphic cards, sound cards, memory (RAM), motherboard, displays, power supplies, cables, keyboards, printers and "mice" input devices are all hardware.

text: History of computing hardware

text:
First generation (mechanical/electromechanical)
Calculators
Pascal's calculator, Arithmometer, Difference engine, Quevedo's analytical machines

Programmable devices
Jacquard loom, Analytical engine, IBM ASCC/Harvard Mark I, Harvard Mark II, IBM SSEC, Z1, Z2, Z3

Second generation (vacuum tubes)
Calculators
Atanasoff–Berry Computer, IBM 604, UNIVAC 60, UNIVAC 120

Programmable devices
Colossus, ENIAC, Manchester Small-Scale Experimental Machine, EDSAC, Manchester Mark 1, Ferranti Pegasus, Ferranti Mercury, CSIRAC, EDVAC, UNIVAC I, IBM 701, IBM 702, IBM 650, Z22

Third generation (discrete transistors and SSI, MSI, LSI integrated circuits)
Mainframes
IBM 7090, IBM 7080, IBM System/360, BUNCH

Minicomputer
HP 2116A, IBM System/32, IBM System/36, LINC, PDP-8, PDP-11

Desktop Computer
Programma 101, HP 9100

Fourth generation (VLSI integrated circuits)
Minicomputer
VAX, IBM System i

4-bit microcomputer
Intel 4004, Intel 4040

8-bit microcomputer
Intel 8008, Intel 8080, Motorola 6800, Motorola 6809, MOS Technology 6502, Zilog Z80

16-bit microcomputer
Intel 8088, Zilog Z8000, WDC 65816/65802

32-bit microcomputer
Intel 80386, Pentium, Motorola 68000, ARM

64-bit microcomputer[56]
Alpha, MIPS, PA-RISC, PowerPC, SPARC, x86-64, ARMv8-A

Embedded computer
Intel 8048, Intel 8051

Personal computer
Desktop computer, Home computer, Laptop computer, Personal digital assistant (PDA), Portable computer, Tablet PC, Wearable computer

Theoretical/experimental
Quantum computer, Chemical computer, DNA computing, Optical computer, Spintronics based computer

text: Other hardware topics

text:
Peripheral device (input/output)
Input
Mouse, keyboard, joystick, image scanner, webcam, graphics tablet, microphone

Output
Monitor, printer, loudspeaker

Both
Floppy disk drive, hard disk drive, optical disc drive, teleprinter

Computer buses
Short range
RS-232, SCSI, PCI, USB

Long range (computer networking)
Ethernet, ATM, FDDI

text: A general purpose computer has four main components: the arithmetic logic unit (ALU), the control unit, the memory, and the input and output devices (collectively termed I/O). These parts are interconnected by buses, often made of groups of wires. Inside each of these parts are thousands to trillions of small electrical circuits which can be turned off or on by means of an electronic switch. Each circuit represents a bit (binary digit) of information so that when the circuit is on it represents a "1", and when off it represents a "0" (in positive logic representation). The circuits are arranged in logic gates so that one or more of the circuits may control the state of one or more of the other circuits.

text: Input devices

text: When unprocessed data is sent to the computer with the help of input devices, the data is processed and sent to output devices. The input devices may be hand-operated or automated. The act of processing is mainly regulated by the CPU. Some examples of hand-operated input devices are:

text:
Computer keyboard
Digital camera
Digital video
Graphics tablet
Image scanner
Joystick
Microphone
Mouse
Overlay keyboard
Trackball
Touchscreen

text: Output devices

text: The means through which computer gives output are known as output devices. Some examples of output devices are:

text:
Computer monitor
Printer
PC speaker
Projector
Sound card
Video card

text: Control unit

text: The control unit (often called a control system or central controller) manages the computer's various components; it reads and interprets (decodes) the program instructions, transforming them into control signals that activate other parts of the computer.[57] Control systems in advanced computers may change the order of execution of some instructions to improve performance.

text: A key component common to all CPUs is the program counter, a special memory cell (a register) that keeps track of which location in memory the next instruction is to be read from.[58]

text: The control system's function is as follows—note that this is a simplified description, and some of these steps may be performed concurrently or in a different order depending on the type of CPU:

text:
Read the code for the next instruction from the cell indicated by the program counter.
Decode the numerical code for the instruction into a set of commands or signals for each of the other systems.
Increment the program counter so it points to the next instruction.
Read whatever data the instruction requires from cells in memory (or perhaps from an input device). The location of this required data is typically stored within the instruction code.
Provide the necessary data to an ALU or register.
If the instruction requires an ALU or specialized hardware to complete, instruct the hardware to perform the requested operation.
Write the result from the ALU back to a memory location or to a register or perhaps an output device.
Jump back to step (1).

tag: ol

text: Since the program counter is (conceptually) just another set of memory cells, it can be changed by calculations done in the ALU. Adding 100 to the program counter would cause the next instruction to be read from a place 100 locations further down the program. Instructions that modify the program counter are often known as "jumps" and allow for loops (instructions that are repeated by the computer) and often conditional instruction execution (both examples of control flow).

text: The sequence of operations that the control unit goes through to process an instruction is in itself like a short computer program, and indeed, in some more complex CPU designs, there is another yet smaller computer called a microsequencer, which runs a microcode program that causes all of these events to happen.

text: Central processing unit (CPU)

text: The control unit, ALU, and registers are collectively known as a central processing unit (CPU). Early CPUs were composed of many separate components but since the mid-1970s CPUs have typically been constructed on a single integrated circuit called a microprocessor.

text: Arithmetic logic unit (ALU)

text: The ALU is capable of performing two classes of operations: arithmetic and logic.[59] The set of arithmetic operations that a particular ALU supports may be limited to addition and subtraction, or might include multiplication, division, trigonometry functions such as sine, cosine, etc., and square roots. Some can only operate on whole numbers (integers) whilst others use floating point to represent real numbers, albeit with limited precision. However, any computer that is capable of performing just the simplest operations can be programmed to break down the more complex operations into simple steps that it can perform. Therefore, any computer can be programmed to perform any arithmetic operation—although it will take more time to do so if its ALU does not directly support the operation. An ALU may also compare numbers and return boolean truth values (true or false) depending on whether one is equal to, greater than or less than the other ("is 64 greater than 65?"). Logic operations involve Boolean logic: AND, OR, XOR, and NOT. These can be useful for creating complicated conditional statements and processing boolean logic.

text: Superscalar computers may contain multiple ALUs, allowing them to process several instructions simultaneously.[60] Graphics processors and computers with SIMD and MIMD features often contain ALUs that can perform arithmetic on vectors and matrices.

text: Memory

text: A computer's memory can be viewed as a list of cells into which numbers can be placed or read. Each cell has a numbered "address" and can store a single number. The computer can be instructed to "put the number 123 into the cell numbered 1357" or to "add the number that is in cell 1357 to the number that is in cell 2468 and put the answer into cell 1595." The information stored in memory may represent practically anything. Letters, numbers, even computer instructions can be placed into memory with equal ease. Since the CPU does not differentiate between different types of information, it is the software's responsibility to give significance to what the memory sees as nothing but a series of numbers.

text: In almost all modern computers, each memory cell is set up to store binary numbers in groups of eight bits (called a byte). Each byte is able to represent 256 different numbers (28 = 256); either from 0 to 255 or −128 to +127. To store larger numbers, several consecutive bytes may be used (typically, two, four or eight). When negative numbers are required, they are usually stored in two's complement notation. Other arrangements are possible, but are usually not seen outside of specialized applications or historical contexts. A computer can store any kind of information in memory if it can be represented numerically. Modern computers have billions or even trillions of bytes of memory.

text: The CPU contains a special set of memory cells called registers that can be read and written to much more rapidly than the main memory area. There are typically between two and one hundred registers depending on the type of CPU. Registers are used for the most frequently needed data items to avoid having to access main memory every time data is needed. As data is constantly being worked on, reducing the need to access main memory (which is often slow compared to the ALU and control units) greatly increases the computer's speed.

text: Computer main memory comes in two principal varieties:

text:
random-access memory or RAM
read-only memory or ROM

text: RAM can be read and written to anytime the CPU commands it, but ROM is preloaded with data and software that never changes, therefore the CPU can only read from it. ROM is typically used to store the computer's initial start-up instructions. In general, the contents of RAM are erased when the power to the computer is turned off, but ROM retains its data indefinitely. In a PC, the ROM contains a specialized program called the BIOS that orchestrates loading the computer's operating system from the hard disk drive into RAM whenever the computer is turned on or reset. In embedded computers, which frequently do not have disk drives, all of the required software may be stored in ROM. Software stored in ROM is often called firmware, because it is notionally more like hardware than software. Flash memory blurs the distinction between ROM and RAM, as it retains its data when turned off but is also rewritable. It is typically much slower than conventional ROM and RAM however, so its use is restricted to applications where high speed is unnecessary.[61]

text: In more sophisticated computers there may be one or more RAM cache memories, which are slower than registers but faster than main memory. Generally computers with this sort of cache are designed to move frequently needed data into the cache automatically, often without the need for any intervention on the programmer's part.

text: Input/output (I/O)

text: I/O is the means by which a computer exchanges information with the outside world.[62] Devices that provide input or output to the computer are called peripherals.[63] On a typical personal computer, peripherals include input devices like the keyboard and mouse, and output devices such as the display and printer. Hard disk drives, floppy disk drives and optical disc drives serve as both input and output devices. Computer networking is another form of I/O. I/O devices are often complex computers in their own right, with their own CPU and memory. A graphics processing unit might contain fifty or more tiny computers that perform the calculations necessary to display 3D graphics.[citation needed] Modern desktop computers contain many smaller computers that assist the main CPU in performing I/O. A 2016-era flat screen display contains its own computer circuitry.

text: Multitasking

text: While a computer may be viewed as running one gigantic program stored in its main memory, in some systems it is necessary to give the appearance of running several programs simultaneously. This is achieved by multitasking i.e. having the computer switch rapidly between running each program in turn.[64] One means by which this is done is with a special signal called an interrupt, which can periodically cause the computer to stop executing instructions where it was and do something else instead. By remembering where it was executing prior to the interrupt, the computer can return to that task later. If several programs are running "at the same time". then the interrupt generator might be causing several hundred interrupts per second, causing a program switch each time. Since modern computers typically execute instructions several orders of magnitude faster than human perception, it may appear that many programs are running at the same time even though only one is ever executing in any given instant. This method of multitasking is sometimes termed "time-sharing" since each program is allocated a "slice" of time in turn.[65]

text: Before the era of inexpensive computers, the principal use for multitasking was to allow many people to share the same computer. Seemingly, multitasking would cause a computer that is switching between several programs to run more slowly, in direct proportion to the number of programs it is running, but most programs spend much of their time waiting for slow input/output devices to complete their tasks. If a program is waiting for the user to click on the mouse or press a key on the keyboard, then it will not take a "time slice" until the event it is waiting for has occurred. This frees up time for other programs to execute so that many programs may be run simultaneously without unacceptable speed loss.

text: Multiprocessing

text: Some computers are designed to distribute their work across several CPUs in a multiprocessing configuration, a technique once employed only in large and powerful machines such as supercomputers, mainframe computers and servers. Multiprocessor and multi-core (multiple CPUs on a single integrated circuit) personal and laptop computers are now widely available, and are being increasingly used in lower-end markets as a result.

text: Supercomputers in particular often have highly unique architectures that differ significantly from the basic stored-program architecture and from general purpose computers.[66] They often feature thousands of CPUs, customized high-speed interconnects, and specialized computing hardware. Such designs tend to be useful only for specialized tasks due to the large scale of program organization required to successfully utilize most of the available resources at once. Supercomputers usually see usage in large-scale simulation, graphics rendering, and cryptography applications, as well as with other so-called "embarrassingly parallel" tasks.

text: Software

text: Software refers to parts of the computer which do not have a material form, such as programs, data, protocols, etc. Software is that part of a computer system that consists of encoded information or computer instructions, in contrast to the physical hardware from which the system is built. Computer software includes computer programs, libraries and related non-executable data, such as online documentation or digital media. Computer hardware and software require each other and neither can be realistically used on its own. When software is stored in hardware that cannot easily be modified, such as with BIOS ROM in an IBM PC compatible computer, it is sometimes called "firmware".

text: Operating systems

text:
Operating system /System Software
Unix and BSD
UNIX System V, IBM AIX, HP-UX, Solaris (SunOS), IRIX, List of BSD operating systems

GNU/Linux
List of Linux distributions, Comparison of Linux distributions

Microsoft Windows
Windows 95, Windows 98, Windows NT, Windows 2000, Windows Me, Windows XP, Windows Vista, Windows 7, Windows 8 / 8.1, Windows 10

DOS
86-DOS (QDOS), IBM PC DOS, MS-DOS, DR-DOS, FreeDOS

Mac OS
Classic Mac OS, macOS (previously OS X and Mac OS X)

Embedded and real-time
List of embedded operating systems

Experimental
Amoeba, Oberon/Bluebottle, Plan 9 from Bell Labs

Library
Multimedia
DirectX, OpenGL, OpenAL, Vulkan (API)

Programming library
C standard library, Standard Template Library

Data
Protocol
TCP/IP, Kermit, FTP, HTTP, SMTP

File format
HTML, XML, JPEG, MPEG, PNG

User interface
Graphical user interface (WIMP)
Microsoft Windows, GNOME, KDE, QNX Photon, CDE, GEM, Aqua

Text-based user interface
Command-line interface, Text user interface

Application Software
Office suite
Word processing, Desktop publishing, Presentation program, Database management system, Scheduling & Time management, Spreadsheet, Accounting software

Internet Access
Browser, Email client, Web server, Mail transfer agent, Instant messaging

Design and manufacturing
Computer-aided design, Computer-aided manufacturing, Plant management, Robotic manufacturing, Supply chain management

Graphics
Raster graphics editor, Vector graphics editor, 3D modeler, Animation editor, 3D computer graphics, Video editing, Image processing

Audio
Digital audio editor, Audio playback, Mixing, Audio synthesis, Computer music

Software engineering
Compiler, Assembler, Interpreter, Debugger, Text editor, Integrated development environment, Software performance analysis, Revision control, Software configuration management

Educational
Edutainment, Educational game, Serious game, Flight simulator

Games
Strategy, Arcade, Puzzle, Simulation, First-person shooter, Platform, Massively multiplayer, Interactive fiction

Misc
Artificial intelligence, Antivirus software, Malware scanner, Installer/Package management systems, File manager

text: Languages

text: There are thousands of different programming languages—some intended to be general purpose, others useful only for highly specialized applications.

text:
Programming languages

Lists of programming languages
Timeline of programming languages, List of programming languages by category, Generational list of programming languages, List of programming languages, Non-English-based programming languages

Commonly used assembly languages
ARM, MIPS, x86

Commonly used high-level programming languages
Ada, BASIC, C, C++, C#, COBOL, Fortran, PL/1, REXX, Java, Lisp, Pascal, Object Pascal

Commonly used scripting languages
Bourne script, JavaScript, Python, Ruby, PHP, Perl

text: Application Software

text: Programs

text: The defining feature of modern computers which distinguishes them from all other machines is that they can be programmed. That is to say that some type of instructions (the program) can be given to the computer, and it will process them. Modern computers based on the von Neumann architecture often have machine code in the form of an imperative programming language. In practical terms, a computer program may be just a few instructions or extend to many millions of instructions, as do the programs for word processors and web browsers for example. A typical modern computer can execute billions of instructions per second (gigaflops) and rarely makes a mistake over many years of operation. Large computer programs consisting of several million instructions may take teams of programmers years to write, and due to the complexity of the task almost certainly contain errors.

text: Stored program architecture

text: This section applies to most common RAM machine-based computers.

text: In most cases, computer instructions are simple: add one number to another, move some data from one location to another, send a message to some external device, etc. These instructions are read from the computer's memory and are generally carried out (executed) in the order they were given. However, there are usually specialized instructions to tell the computer to jump ahead or backwards to some other place in the program and to carry on executing from there. These are called "jump" instructions (or branches). Furthermore, jump instructions may be made to happen conditionally so that different sequences of instructions may be used depending on the result of some previous calculation or some external event. Many computers directly support subroutines by providing a type of jump that "remembers" the location it jumped from and another instruction to return to the instruction following that jump instruction.

text: Program execution might be likened to reading a book. While a person will normally read each word and line in sequence, they may at times jump back to an earlier place in the text or skip sections that are not of interest. Similarly, a computer may sometimes go back and repeat the instructions in some section of the program over and over again until some internal condition is met. This is called the flow of control within the program and it is what allows the computer to perform tasks repeatedly without human intervention.

text: Comparatively, a person using a pocket calculator can perform a basic arithmetic operation such as adding two numbers with just a few button presses. But to add together all of the numbers from 1 to 1,000 would take thousands of button presses and a lot of time, with a near certainty of making a mistake. On the other hand, a computer may be programmed to do this with just a few simple instructions. The following example is written in the MIPS assembly language:

text: Once told to run this program, the computer will perform the repetitive addition task without further human intervention. It will almost never make a mistake and a modern PC can complete the task in a fraction of a second.

text: Machine code

text: In most computers, individual instructions are stored as machine code with each instruction being given a unique number (its operation code or opcode for short). The command to add two numbers together would have one opcode; the command to multiply them would have a different opcode, and so on. The simplest computers are able to perform any of a handful of different instructions; the more complex computers have several hundred to choose from, each with a unique numerical code. Since the computer's memory is able to store numbers, it can also store the instruction codes. This leads to the important fact that entire programs (which are just lists of these instructions) can be represented as lists of numbers and can themselves be manipulated inside the computer in the same way as numeric data. The fundamental concept of storing programs in the computer's memory alongside the data they operate on is the crux of the von Neumann, or stored program[citation needed], architecture. In some cases, a computer might store some or all of its program in memory that is kept separate from the data it operates on. This is called the Harvard architecture after the Harvard Mark I computer. Modern von Neumann computers display some traits of the Harvard architecture in their designs, such as in CPU caches.

text: While it is possible to write computer programs as long lists of numbers (machine language) and while this technique was used with many early computers,[67] it is extremely tedious and potentially error-prone to do so in practice, especially for complicated programs. Instead, each basic instruction can be given a short name that is indicative of its function and easy to remember – a mnemonic such as ADD, SUB, MULT or JUMP. These mnemonics are collectively known as a computer's assembly language. Converting programs written in assembly language into something the computer can actually understand (machine language) is usually done by a computer program called an assembler.

text: Programming language

text: Programming languages provide various ways of specifying programs for computers to run. Unlike natural languages, programming languages are designed to permit no ambiguity and to be concise. They are purely written languages and are often difficult to read aloud. They are generally either translated into machine code by a compiler or an assembler before being run, or translated directly at run time by an interpreter. Sometimes programs are executed by a hybrid method of the two techniques.

text: Low-level languages

text: Machine languages and the assembly languages that represent them (collectively termed low-level programming languages) tend to be unique to a particular type of computer. For instance, an ARM architecture computer (such as may be found in a smartphone or a hand-held videogame) cannot understand the machine language of an x86 CPU that might be in a PC.[68]

text: High-level languages/third generation language

text: Though considerably easier than in machine language, writing long programs in assembly language is often difficult and is also error prone. Therefore, most practical programs are written in more abstract high-level programming languages that are able to express the needs of the programmer more conveniently (and thereby help reduce programmer error). High level languages are usually "compiled" into machine language (or sometimes into assembly language and then into machine language) using another computer program called a compiler.[69] High level languages are less related to the workings of the target computer than assembly language, and more related to the language and structure of the problem(s) to be solved by the final program. It is therefore often possible to use different compilers to translate the same high level language program into the machine language of many different types of computer. This is part of the means by which software like video games may be made available for different computer architectures such as personal computers and various video game consoles.

text: Fourth generation languages

text: These 4G languages are less procedural than 3G languages. The benefit of 4GL is that they provide ways to obtain information without requiring the direct help of a programmer. An example of a 4GL is SQL.

text: Program design

text: This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (July 2012) (Learn how and when to remove this template message)

text: Program design of small programs is relatively simple and involves the analysis of the problem, collection of inputs, using the programming constructs within languages, devising or using established procedures and algorithms, providing data for output devices and solutions to the problem as applicable. As problems become larger and more complex, features such as subprograms, modules, formal documentation, and new paradigms such as object-oriented programming are encountered. Large programs involving thousands of line of code and more require formal software methodologies. The task of developing large software systems presents a significant intellectual challenge. Producing software with an acceptably high reliability within a predictable schedule and budget has historically been difficult; the academic and professional discipline of software engineering concentrates specifically on this challenge.

text: Bugs

text: Errors in computer programs are called "bugs". They may be benign and not affect the usefulness of the program, or have only subtle effects. But in some cases, they may cause the program or the entire system to "hang", becoming unresponsive to input such as mouse clicks or keystrokes, to completely fail, or to crash. Otherwise benign bugs may sometimes be harnessed for malicious intent by an unscrupulous user writing an exploit, code designed to take advantage of a bug and disrupt a computer's proper execution. Bugs are usually not the fault of the computer. Since computers merely execute the instructions they are given, bugs are nearly always the result of programmer error or an oversight made in the program's design.[70] Admiral Grace Hopper, an American computer scientist and developer of the first compiler, is credited for having first used the term "bugs" in computing after a dead moth was found shorting a relay in the Harvard Mark II computer in September 1947.[71]

text: Firmware

text: Firmware is the technology which has the combination of both hardware and software such as BIOS chip inside a computer. This chip (hardware) is located on the motherboard and has the BIOS set up (software) stored in it.

text: Networking and the Internet

text: Computers have been used to coordinate information between multiple locations since the 1950s. The U.S. military's SAGE system was the first large-scale example of such a system, which led to a number of special-purpose commercial systems such as Sabre.[72] In the 1970s, computer engineers at research institutions throughout the United States began to link their computers together using telecommunications technology. The effort was funded by ARPA (now DARPA), and the computer network that resulted was called the ARPANET.[73] The technologies that made the Arpanet possible spread and evolved.

text: In time, the network spread beyond academic and military institutions and became known as the Internet. The emergence of networking involved a redefinition of the nature and boundaries of the computer. Computer operating systems and applications were modified to include the ability to define and access the resources of other computers on the network, such as peripheral devices, stored information, and the like, as extensions of the resources of an individual computer. Initially these facilities were available primarily to people working in high-tech environments, but in the 1990s the spread of applications like e-mail and the World Wide Web, combined with the development of cheap, fast networking technologies like Ethernet and ADSL saw computer networking become almost ubiquitous. In fact, the number of computers that are networked is growing phenomenally. A very large proportion of personal computers regularly connect to the Internet to communicate and receive information. "Wireless" networking, often utilizing mobile phone networks, has meant networking is becoming increasingly ubiquitous even in mobile computing environments.

text: Unconventional computers

text: A computer does not need to be electronic, nor even have a processor, nor RAM, nor even a hard disk. While popular usage of the word "computer" is synonymous with a personal electronic computer, the modern[74] definition of a computer is literally: "A device that computes, especially a programmable [usually] electronic machine that performs high-speed mathematical or logical operations or that assembles, stores, correlates, or otherwise processes information."[75] Any device which processes information qualifies as a computer, especially if the processing is purposeful.[citation needed]

text: Unconventional computing

text: Historically, computers evolved from mechanical computers and eventually from vacuum tubes to transistors. However, conceptually computational systems as flexible as a personal computer can be built out of almost anything. For example, a computer can be made out of billiard balls (billiard ball computer); an often quoted example.[citation needed] More realistically, modern computers are made out of transistors made of photolithographed semiconductors.

text: Future

text: There is active research to make computers out of many promising new types of technology, such as optical computers, DNA computers, neural computers, and quantum computers. Most computers are universal, and are able to calculate any computable function, and are limited only by their memory capacity and operating speed. However different designs of computers can give very different performance for particular problems; for example quantum computers can potentially break some modern encryption algorithms (by quantum factoring) very quickly.

text: Computer architecture paradigms

text: There are many types of computer architectures:

text:
Quantum computer vs. Chemical computer
Scalar processor vs. Vector processor
Non-Uniform Memory Access (NUMA) computers
Register machine vs. Stack machine
Harvard architecture vs. von Neumann architecture
Cellular architecture

text: Of all these abstract machines, a quantum computer holds the most promise for revolutionizing computing.[76] Logic gates are a common abstraction which can apply to most of the above digital or analog paradigms. The ability to store and execute lists of instructions called programs makes computers extremely versatile, distinguishing them from calculators. The Church–Turing thesis is a mathematical statement of this versatility: any computer with a minimum capability (being Turing-complete) is, in principle, capable of performing the same tasks that any other computer can perform. Therefore, any type of computer (netbook, supercomputer, cellular automaton, etc.) is able to perform the same computational tasks, given enough time and storage capacity.

text: Artificial intelligence

text: A computer will solve problems in exactly the way it is programmed to, without regard to efficiency, alternative solutions, possible shortcuts, or possible errors in the code. Computer programs that learn and adapt are part of the emerging field of artificial intelligence and machine learning.

text: Professions and organizations

text: As the use of computers has spread throughout society, there are an increasing number of careers involving computers.

text:
Computer-related professions

Hardware-related
Electrical engineering, Electronic engineering, Computer engineering, Telecommunications engineering, Optical engineering, Nanoengineering

Software-related
Computer science, Computer engineering, Desktop publishing, Human–computer interaction, Information technology, Information systems, Computational science, Software engineering, Video game industry, Web design

text: The need for computers to work well together and to be able to exchange information has spawned the need for many standards organizations, clubs and societies of both a formal and informal nature.

text:
Organizations

Standards groups
ANSI, IEC, IEEE, IETF, ISO, W3C

Professional societies
ACM, AIS, IET, IFIP, BCS

Free/open source software groups
Free Software Foundation, Mozilla Foundation, Apache Software Foundation


document_title: List of Super Bowl champions

question_text: who have the patriots lost to in super bowls

root

text: List of Super Bowl champions

text: Super Bowl Championship (1966–present)

text: Numbers in parentheses in the table are Super Bowl appearances as of the date of that Super Bowl and are used as follows:

tag: p

text:
Winning team and losing team columns indicate the number of times that team has appeared in a Super Bowl as well as each respective teams' Super Bowl record to date.
Venue column indicates number of times that stadium has hosted a Super Bowl.
City column indicates number of times that metropolitan area has hosted a Super Bowl.

tag: ul

text:
National Football League (NFL, 1967–1970)
American Football League (AFL, 1967–1970)

NFL champion‡
(4, 2–2)
AFL champion^
(4, 2–2)

National Football Conference (NFC, 1971–present)
American Football Conference (AFC, 1971–present)

NFC champion*
(48, 25–23)
AFC champion†
(48, 23–25)

tag: table

text:
Game
Date
Winning team
Score
Losing team
Venue
City
Attendance
Ref

01 !I
000000001967-01-15-0000January 15, 1967
Green Bay Packers 01 !Green Bay Packers‡
(1, 1–0)
3510 !35–10
Kansas City Chiefs 01 !Kansas City Chiefs^
(1, 0–1)
Los Angeles Memorial Coliseum 01 !Los Angeles Memorial Coliseum
Los Angeles, California 01 !Los Angeles, California[note 1]
061946 !61,946
[11]

02 !II
000000001968-01-14-0000January 14, 1968
Green Bay Packers 02 !Green Bay Packers‡
(2, 2–0)
3314 !33–14
Oakland Raiders 01 !Oakland Raiders^
(1, 0–1)
Miami Orange Bowl 01 !Miami Orange Bowl
Miami, Florida 01 !Miami, Florida[note 2]
075546 !75,546
[12]

03 !III
000000001969-01-12-0000January 12, 1969
New York Jets 01 !New York Jets^
(1, 1–0)
1607 !16–7
Indianapolis Colts 01 !Baltimore Colts‡
(1, 0–1)
Miami Orange Bowl 02 !Miami Orange Bowl (2)
Miami, Florida 02 !Miami, Florida (2)[note 2]
075389 !75,389
[13]

04 !IV
000000001970-01-11-0000January 11, 1970
Kansas City Chiefs 02 !Kansas City Chiefs^
(2, 1–1)
2307 !23–7
Minnesota Vikings 01 !Minnesota Vikings‡
(1, 0–1)
Tulane Stadium 01 !Tulane Stadium
New Orleans, Louisiana 01 !New Orleans, Louisiana
080562 !80,562
[14]

05 !V
000000001971-01-17-0000January 17, 1971
Indianapolis Colts 02 !Baltimore Colts†
(2, 1–1)
1613 !16–13
Dallas Cowboys 01 !Dallas Cowboys*
(1, 0–1)
Miami Orange Bowl 03 !Miami Orange Bowl (3)
Miami, Florida 03 !Miami, Florida (3)[note 2]
079204 !79,204
[15]

06 !VI
000000001972-01-16-0000January 16, 1972
Dallas Cowboys 02 !Dallas Cowboys*
(2, 1–1)
2403 !24–3
Miami Dolphins 01 !Miami Dolphins†
(1, 0–1)
Tulane Stadium 02 !Tulane Stadium (2)
New Orleans, Louisiana 02 !New Orleans, Louisiana (2)
081023 !81,023
[16]

07 !VII
000000001973-01-14-0000January 14, 1973
Miami Dolphins 02 !Miami Dolphins†
(2, 1–1)
1407 !14–7
Washington Redskins 01 !Washington Redskins*
(1, 0–1)
Los Angeles Memorial Coliseum 02 !Los Angeles Memorial Coliseum (2)
Los Angeles, California 02 !Los Angeles, California (2)[note 1]
090182 !90,182
[17]

08 !VIII
000000001974-01-13-0000January 13, 1974
Miami Dolphins 03 !Miami Dolphins†
(3, 2–1)
2407 !24–7
Minnesota Vikings 02 !Minnesota Vikings*
(2, 0–2)
Rice Stadium 01 !Rice Stadium
Houston, Texas 01 !Houston, Texas
071882 !71,882
[18]

09 !IX
000000001975-01-12-0000January 12, 1975
Pittsburgh Steelers 01 !Pittsburgh Steelers†
(1, 1–0)
1606 !16–6
Minnesota Vikings 03 !Minnesota Vikings*
(3, 0–3)
Tulane Stadium 03 !Tulane Stadium (3)
New Orleans, Louisiana 03 !New Orleans, Louisiana (3)
080997 !80,997
[19]

10 !X
000000001976-01-18-0000January 18, 1976
Pittsburgh Steelers 02 !Pittsburgh Steelers†
(2, 2–0)
2117 !21–17
Dallas Cowboys 03 !Dallas Cowboys*
(3, 1–2)
Miami Orange Bowl 04 !Miami Orange Bowl (4)
Miami, Florida 04 !Miami, Florida (4)[note 2]
080187 !80,187
[20]

11 !XI
000000001977-01-09-0000January 9, 1977
Oakland Raiders 02 !Oakland Raiders†
(2, 1–1)
3214 !32–14
Minnesota Vikings 04 !Minnesota Vikings*
(4, 0–4)
Rose Bowl 01 !Rose Bowl
Los Angeles, California 03 !Pasadena, California (3)[note 1]
103438 !103,438
[21]

12 !XII
000000001978-01-15-0000January 15, 1978
Dallas Cowboys 04 !Dallas Cowboys*
(4, 2–2)
2710 !27–10
Denver Broncos 01 !Denver Broncos†
(1, 0–1)
Louisiana Superdome 01 !Louisiana Superdome
New Orleans, Louisiana 04 !New Orleans, Louisiana (4)
076400 !76,400
[22]

13 !XIII
000000001979-01-21-0000January 21, 1979
Pittsburgh Steelers 03 !Pittsburgh Steelers†
(3, 3–0)
3531 !35–31
Dallas Cowboys 05 !Dallas Cowboys*
(5, 2–3)
Miami Orange Bowl 05 !Miami Orange Bowl (5)
Miami, Florida 05 !Miami, Florida (5)[note 2]
079484 !79,484
[23]

14 !XIV
000000001980-01-20-0000January 20, 1980
Pittsburgh Steelers 04 !Pittsburgh Steelers†
(4, 4–0)
3119 !31–19
Los Angeles Rams 01 !Los Angeles Rams*
(1, 0–1)
Rose Bowl 02 !Rose Bowl (2)
Los Angeles, California 04 !Pasadena, California (4)[note 1]
103985 !103,985
[24]

15 !XV
000000001981-01-25-0000January 25, 1981
Oakland Raiders 03 !Oakland Raiders†
(3, 2–1)
2710 !27–10
Philadelphia Eagles 01 !Philadelphia Eagles*
(1, 0–1)
Louisiana Superdome 02 !Louisiana Superdome (2)
New Orleans, Louisiana 05 !New Orleans, Louisiana (5)
076135 !76,135
[25]

16 !XVI
000000001982-01-24-0000January 24, 1982
San Francisco 49ers 01 !San Francisco 49ers*
(1, 1–0)
2621 !26–21
Cincinnati Bengals 01 !Cincinnati Bengals†
(1, 0–1)
Pontiac Silverdome 01 !Pontiac Silverdome
Detroit, Michigan 01 !Pontiac, Michigan[note 1]
081270 !81,270
[26]

17 !XVII
000000001983-01-30-0000January 30, 1983
Washington Redskins 02 !Washington Redskins*
(2, 1–1)
2717 !27–17
Miami Dolphins 04 !Miami Dolphins†
(4, 2–2)
Rose Bowl 03 !Rose Bowl (3)
Los Angeles, California 05 !Pasadena, California (5)[note 1]
103667 !103,667
[27]

18 !XVIII
000000001984-01-22-0000January 22, 1984
Oakland Raiders 04 !Los Angeles Raiders†
(4, 3–1)
3809 !38–9
Washington Redskins 03 !Washington Redskins*
(3, 1–2)
Tampa Stadium 01 !Tampa Stadium
Tampa, Florida 01 !Tampa, Florida
072920 !72,920
[28]

19 !XIX
000000001985-01-20-0000January 20, 1985
San Francisco 49ers 02 !San Francisco 49ers*
(2, 2–0)
3816 !38–16
Miami Dolphins 05 !Miami Dolphins†
(5, 2–3)
Stanford Stadium 01 !Stanford Stadium
San Francisco, California 01 !Stanford, California[note 1]
084059 !84,059
[29]

20 !XX
000000001986-01-26-0000January 26, 1986
Chicago Bears 01 !Chicago Bears*
(1, 1–0)
4610 !46–10
New England Patriots 01 !New England Patriots†
(1, 0–1)
Louisiana Superdome 03 !Louisiana Superdome (3)
New Orleans, Louisiana 06 !New Orleans, Louisiana (6)
073818 !73,818
[30]

21 !XXI
000000001987-01-25-0000January 25, 1987
New York Giants 01 !New York Giants*
(1, 1–0)
3920 !39–20
Denver Broncos 02 !Denver Broncos†
(2, 0–2)
Rose Bowl 04 !Rose Bowl (4)
Los Angeles, California 06 !Pasadena, California (6)[note 1]
101063 !101,063
[31]

22 !XXII
000000001988-01-31-0000January 31, 1988
Washington Redskins 04 !Washington Redskins*
(4, 2–2)
4210 !42–10
Denver Broncos 03 !Denver Broncos†
(3, 0–3)
Qualcomm Stadium 01 !San Diego–Jack Murphy Stadium[note 3]
San Diego, California 01 !San Diego, California
073302 !73,302
[32]

23 !XXIII
000000001989-01-22-0000January 22, 1989
San Francisco 49ers 03 !San Francisco 49ers*
(3, 3–0)
2016 !20–16
Cincinnati Bengals 02 !Cincinnati Bengals†
(2, 0–2)
Hard Rock Stadium 01 !Joe Robbie Stadium[note 3]
Miami, Florida 06 !Miami Gardens, Florida (6)[note 2]
075129 !75,129
[33]

24 !XXIV
000000001990-01-28-0000January 28, 1990
San Francisco 49ers 04 !San Francisco 49ers*
(4, 4–0)
5510 !55–10
Denver Broncos 04 !Denver Broncos†
(4, 0–4)
Louisiana Superdome 04 !Louisiana Superdome (4)
New Orleans, Louisiana 07 !New Orleans, Louisiana (7)
072919 !72,919
[34]

25 !XXV
000000001991-01-27-0000January 27, 1991
New York Giants 02 !New York Giants*
(2, 2–0)
2019 !20–19
Buffalo Bills 01 !Buffalo Bills†
(1, 0–1)
Tampa Stadium 02 !Tampa Stadium (2)
Tampa, Florida 02 !Tampa, Florida (2)
073813 !73,813
[35]

26 !XXVI
000000001992-01-26-0000January 26, 1992
Washington Redskins 05 !Washington Redskins*
(5, 3–2)
3724 !37–24
Buffalo Bills 02 !Buffalo Bills†
(2, 0–2)
Metrodome 01 !Metrodome
Minneapolis, Minnesota 01 !Minneapolis, Minnesota
063130 !63,130
[36]

27 !XXVII
000000001993-01-31-0000January 31, 1993
Dallas Cowboys 06 !Dallas Cowboys*
(6, 3–3)
5217 !52–17
Buffalo Bills 03 !Buffalo Bills†
(3, 0–3)
Rose Bowl 05 !Rose Bowl (5)
Los Angeles, California 07 !Pasadena, California (7)[note 1]
098374 !98,374
[37]

28 !XXVIII
000000001994-01-30-0000January 30, 1994
Dallas Cowboys 07 !Dallas Cowboys*
(7, 4–3)
3013 !30–13
Buffalo Bills 04 !Buffalo Bills†
(4, 0–4)
Georgia Dome 01 !Georgia Dome
Atlanta, Georgia 01 !Atlanta, Georgia
072817 !72,817
[38]

29 !XXIX
000000001995-01-29-0000January 29, 1995
San Francisco 49ers 05 !San Francisco 49ers*
(5, 5–0)
4926 !49–26
San Diego Chargers 01 !San Diego Chargers†
(1, 0–1)
Hard Rock Stadium 02 !Joe Robbie Stadium (2)[note 3]
Miami, Florida 07 !Miami Gardens, Florida (7)[note 2]
074107 !74,107
[39]

30 !XXX
000000001996-01-28-0000January 28, 1996
Dallas Cowboys 08 !Dallas Cowboys*
(8, 5–3)
2717 !27–17
Pittsburgh Steelers 05 !Pittsburgh Steelers†
(5, 4–1)
Sun Devil Stadium 01 !Sun Devil Stadium
Phoenix, Arizona 01 !Tempe, Arizona[note 1]
076347 !76,347
[40]

31 !XXXI
000000001997-01-26-0000January 26, 1997
Green Bay Packers 03 !Green Bay Packers*
(3, 3–0)
3521 !35–21
New England Patriots 02 !New England Patriots†
(2, 0–2)
Louisiana Superdome 05 !Louisiana Superdome (5)
New Orleans, Louisiana 08 !New Orleans, Louisiana (8)
072301 !72,301
[41]

32 !XXXII
000000001998-01-25-0000January 25, 1998
Denver Broncos 05 !Denver Broncos†
(5, 1–4)
3124 !31–24
Green Bay Packers 04 !Green Bay Packers*
(4, 3–1)
Qualcomm Stadium 02 !Qualcomm Stadium (2)[note 3]
San Diego, California 02 !San Diego, California (2)
068912 !68,912
[42]

33 !XXXIII
000000001999-01-31-0000January 31, 1999
Denver Broncos 06 !Denver Broncos†
(6, 2–4)
3419 !34–19
Atlanta Falcons 01 !Atlanta Falcons*
(1, 0–1)
Hard Rock Stadium 03 !Pro Player Stadium (3)[note 3]
Miami, Florida 08 !Miami Gardens, Florida (8)[note 2]
074803 !74,803
[43]

34 !XXXIV
000000002000-01-30-0000January 30, 2000
Los Angeles Rams 02 !St. Louis Rams*
(2, 1–1)
2316 !23–16
Tennessee Titans 01 !Tennessee Titans†
(1, 0–1)
Georgia Dome 02 !Georgia Dome (2)
Atlanta, Georgia 02 !Atlanta, Georgia (2)
072625 !72,625
[44]

35 !XXXV
000000002001-01-28-0000January 28, 2001
Baltimore Ravens 01 !Baltimore Ravens†
(1, 1–0)
3407 !34–7
New York Giants 03 !New York Giants*
(3, 2–1)
Raymond James Stadium 01 !Raymond James Stadium
Tampa, Florida 03 !Tampa, Florida (3)
071921 !71,921
[45]

36 !XXXVI
000000002002-02-03-0000February 3, 2002
New England Patriots 03 !New England Patriots†
(3, 1–2)
2017 !20–17
Los Angeles Rams 03 !St. Louis Rams*
(3, 1–2)
Louisiana Superdome 06 !Louisiana Superdome (6)
New Orleans, Louisiana 09 !New Orleans, Louisiana (9)
072922 !72,922
[46]

37 !XXXVII
000000002003-01-26-0000January 26, 2003
Tampa Bay Buccaneers 01 !Tampa Bay Buccaneers*
(1, 1–0)
4821 !48–21
Oakland Raiders 05 !Oakland Raiders†
(5, 3–2)
Qualcomm Stadium 03 !Qualcomm Stadium (3)[note 3]
San Diego, California 03 !San Diego, California (3)
067603 !67,603
[47]

38 !XXXVIII
000000002004-02-01-0000February 1, 2004
New England Patriots 04 !New England Patriots†
(4, 2–2)
3229 !32–29
Carolina Panthers 01 !Carolina Panthers*
(1, 0–1)
NRG Stadium 01 !Reliant Stadium[note 3]
Houston, Texas 02 !Houston, Texas (2)
071525 !71,525
[48]

39 !XXXIX
000000002005-02-06-0000February 6, 2005
New England Patriots 05 !New England Patriots†
(5, 3–2)
2421 !24–21
Philadelphia Eagles 02 !Philadelphia Eagles*
(2, 0–2)
ALLTEL Stadium 01 !Alltel Stadium
Jacksonville, Florida 01 !Jacksonville, Florida
078125 !78,125
[49]

40 !XL
000000002006-02-05-0000February 5, 2006
Pittsburgh Steelers 06 !Pittsburgh Steelers†
(6, 5–1)
2110 !21–10
Seattle Seahawks 01 !Seattle Seahawks*
(1, 0–1)
Ford Field 01 !Ford Field
Detroit, Michigan 02 !Detroit, Michigan (2)[note 1]
068206 !68,206
[50]

41 !XLI
000000002007-02-04-0000February 4, 2007
Indianapolis Colts 03 !Indianapolis Colts†
(3, 2–1)
2917 !29–17
Chicago Bears 02 !Chicago Bears*
(2, 1–1)
Hard Rock Stadium 04 !Dolphin Stadium (4)[note 3]
Miami, Florida 09 !Miami Gardens, Florida (9)[note 2]
074512 !74,512
[51]

42 !XLII
000000002008-02-03-0000February 3, 2008
New York Giants 04 !New York Giants*
(4, 3–1)
1714 !17–14
New England Patriots 06 !New England Patriots†
(6, 3–3)
University of Phoenix Stadium 01 !University of Phoenix Stadium
Phoenix, Arizona 02 !Glendale, Arizona (2)[note 1]
071101 !71,101
[52]

43 !XLIII
000000002009-02-01-0000February 1, 2009
Pittsburgh Steelers 07 !Pittsburgh Steelers†
(7, 6–1)
2723 !27–23
Arizona Cardinals 01 !Arizona Cardinals*
(1, 0–1)
Raymond James Stadium 02 !Raymond James Stadium (2)
Tampa, Florida 04 !Tampa, Florida (4)
070774 !70,774
[53]

44 !XLIV
000000002010-02-07-0000February 7, 2010
New Orleans Saints 01 !New Orleans Saints*
(1, 1–0)
3117 !31–17
Indianapolis Colts 04 !Indianapolis Colts†
(4, 2–2)
Hard Rock Stadium 05 !Sun Life Stadium (5)[note 3]
Miami, Florida 10 !Miami Gardens, Florida (10)[note 2]
074059 !74,059
[54]

45 !XLV
000000002011-02-06-0000February 6, 2011
Green Bay Packers 05 !Green Bay Packers*
(5, 4–1)
3125 !31–25
Pittsburgh Steelers 08 !Pittsburgh Steelers†
(8, 6–2)
Cowboys Stadium 01 !Cowboys Stadium
Arlington, Texas 01 !Arlington, Texas
103219 !103,219
[55]

46 !XLVI
000000002012-02-05-0000February 5, 2012
New York Giants 05 !New York Giants*
(5, 4–1)
2117 !21–17
New England Patriots 07 !New England Patriots†
(7, 3–4)
Lucas Oil Stadium 01 !Lucas Oil Stadium
Indianapolis, Indiana 01 !Indianapolis, Indiana
068658 !68,658
[56][57]

47 !XLVII
000000002013-02-03-0000February 3, 2013
Baltimore Ravens 02 !Baltimore Ravens†
(2, 2–0)
3431 !34–31
San Francisco 49ers 06 !San Francisco 49ers*
(6, 5–1)
Louisiana Superdome 07 !Mercedes-Benz Superdome (7)
New Orleans, Louisiana 10 !New Orleans, Louisiana (10)
071024 !71,024
[56][58]

48 !XLVIII
000000002014-02-02-0000February 2, 2014
Seattle Seahawks 02 !Seattle Seahawks*
(2, 1–1)
4308 !43–8
Denver Broncos 07 !Denver Broncos†
(7, 2–5)
MetLife Stadium 01 !MetLife Stadium
East Rutherford, New Jersey 01 !East Rutherford, New Jersey
082529 !82,529
[59]

49 !XLIX
000000002015-02-01-0000February 1, 2015
New England Patriots 08 !New England Patriots†
(8, 4–4)
2824 !28–24
Seattle Seahawks 03 !Seattle Seahawks*
(3, 1–2)
University of Phoenix Stadium 02 !University of Phoenix Stadium (2)
Phoenix, Arizona 03 !Glendale, Arizona (3)[note 1]
070288 !70,288
[60][61]

50 !50 [note 4]
000000002016-02-07-0000February 7, 2016
Denver Broncos 08 !Denver Broncos†
(8, 3–5)
2410 !24–10
Carolina Panthers 02 !Carolina Panthers*
(2, 0–2)
Levi's Stadium 01 !Levi's Stadium
San Francisco, California 02 !Santa Clara, California (2)[note 1]
071088 !71,088
[61][62][63]

51 !LI
000000002017-02-05-0000February 5, 2017
New England Patriots 09 !New England Patriots†
(9, 5–4)
3428 !34–28 (OT)
Atlanta Falcons 02 !Atlanta Falcons*
(2, 0–2)
NRG Stadium 02 !NRG Stadium (2)[note 3]
Houston, Texas 03 !Houston, Texas (3)
070807 !70,807
[61][62][63]

52 !LII
000000002018-02-04-0000February 4, 2018
Philadelphia Eagles 03 !Philadelphia Eagles*
(3, 1–2)
4133 !41–33
New England Patriots 10 !New England Patriots†
(10, 5–5)
U.S. Bank Stadium 01 !U.S. Bank Stadium
Minneapolis, Minnesota 02 !Minneapolis, Minnesota (2)
067612 !67,612
[64][65]

53 !LIII
000000002019-02-03-0000February 3, 2019 [note 5]
X 2019 !2018–19 AFC champion† at 2018–19 NFC champion*
0019 !—
X 2019 !To be determined (TBD)
Mercedes-Benz Stadium 01 !Mercedes-Benz Stadium
Atlanta, Georgia 03 !Atlanta, Georgia (3)
TBD
[66][67]

54 !LIV
000000002020-02-02-0000February 2, 2020 [note 5]
X 2020 !2019–20 NFC champion* at 2019–20 AFC champion†
0020 !—
X 2020 !To be determined
Hard Rock Stadium 06 !Hard Rock Stadium (6)[note 3]
Miami, Florida 11 !Miami Gardens, Florida (11)[note 2]
TBD
[66][67]

55 !LV
000000002021-02-07-0000February 7, 2021 [note 5]
X 2020 !2020–21 AFC champion† at 2020–21 NFC champion*
0021 !—
X 2021 !To be determined
Raymond James Stadium 03 !Raymond James Stadium (3)
Tampa, Florida 05 !Tampa, Florida (5)
TBD
[66][67]

56 !LVI
000000002022-02-06-0000February 6, 2022 [note 5]
X 2021 !2021–22 NFC champion† at 2021–22 AFC champion*
0022 !—
X 2022 !To be determined
City of Champions Stadium 01 !Los Angeles Stadium at Hollywood Park
Los Angeles, California 08 !Inglewood, California (8)[note 1]
TBD
[66][67]

Game
Date
Winning team
Score
Losing team
Venue
City
Attendance
Ref

text: Consecutive winners

text: Seven franchises have won consecutive Super Bowls, one of which (Pittsburgh) has accomplished it twice:

text:
Green Bay Packers (Super Bowls I and II)
Miami Dolphins (VII and VIII)
Pittsburgh Steelers (twice: IX and X as well as XIII and XIV)
San Francisco 49ers (XXIII and XXIV)
Dallas Cowboys (XXVII and XXVIII)
Denver Broncos (XXXII and XXXIII)
New England Patriots (XXXVIII and XXXIX)

text: No franchise has yet won three Super Bowls in a row, although several have come close:

text:
The Green Bay Packers won the first two Super Bowls, and also won the NFL championship the preceding year.
The Miami Dolphins appeared in three consecutive Super Bowls (VI, VII, and VIII), winning the last two.
The Pittsburgh Steelers won two consecutive Super Bowls (IX and X); the following season they were eliminated in the AFC championship game by the eventual Super Bowl champion Oakland Raiders. They also won two more consecutive Super Bowls (XIII and XIV) for four wins in six seasons.
The San Francisco 49ers won two consecutive Super Bowls (XXIII and XXIV); the following season they were eliminated in the NFC championship by the eventual Super Bowl champion New York Giants.
The Dallas Cowboys won two consecutive Super Bowls (XXVII and XXVIII); the following season they were eliminated in the NFC championship game by the eventual champion San Francisco 49ers. The Cowboys won Super Bowl XXX the following year for three wins in four seasons.
The New England Patriots won Super Bowl XXXVI, which was two years before their consecutive wins in XXXVIII and XXXIX, for three wins in four seasons. They did not make the playoffs in the intervening season (XXXVII). The Patriots also won Super Bowls XLIX and LI and in the intervening season (50) were eliminated in the AFC championship game by the eventual champion Denver Broncos.

text: Consecutive losers

text: Three franchises have lost consecutive Super Bowls:

text:
Buffalo Bills (4) (Super Bowls XXV, XXVI, XXVII, and XXVIII) – The only team to appear in four straight Super Bowls, let alone lose in all four appearances.
Minnesota Vikings (2) (Super Bowls VIII and IX) – They also lost Super Bowl XI, and were knocked out of the playoffs for Super Bowl X by the eventual losers the Dallas Cowboys for three losses in four seasons.
Denver Broncos (2) (Super Bowls XXI and XXII) – They also lost Super Bowl XXIV, but did not even make the playoffs for Super Bowl XXIII for three losses in four seasons.

text: Super Bowl appearances by team

text:
NFL‡/NFC* teams (27 wins)
AFL^/AFC† teams (25 wins)

NFL‡/AFC† team (0-1 as part of the NFL, 2-1 as part of the AFC)[note 6]

text: In the sortable table below, teams are ordered first by number of appearances, then by number of wins, and finally by number of years since last appearing in a Super Bowl. In the "Seasons" column, bold years indicate winning seasons, and italic years indicate games not yet completed.

text:
Appearances
Team
Wins
Losses
Winning
percentage
Seasons

10A-05W-01YA-02YW !10
New England Patriots†
05W-10A-02YW-01YA !5
05L-10A-01YL-01YA !5
.500
1985 !1985,† 1996,† 2001,† 2003,† 2004,† 2007,† 2011,† 2014,† 2016,† 2017†

08A-06W-08YA-10YW !8
Pittsburgh Steelers†[note 6]
06W-08A-10YW-08YA !6
02L-08A-08YL-08YA !2
.750
1974 !1974,† 1975,† 1978,† 1979,† 1995,† 2005,† 2008,† 2010†

08A-05W-23YA-23YW !8
Dallas Cowboys*
05W-08A-23YW-23YA !5
03L-08A-40YL-23YA !3
.625
1970 !1970,* 1971,* 1975,* 1977,* 1978,* 1992,* 1993,* 1995*

08A-03W-03YA-03YW !8
Denver Broncos†
03W-08A-03YW-03YA !3
05L-08A-05YL-03YA !5
.375
1977 !1977,† 1986,† 1987,† 1989,† 1997,† 1998,† 2013,† 2015†

06A-05W-06YA-24YW !6
San Francisco 49ers*
05W-06A-24YW-06YA !5
01L-06A-06YL-06YA !1
.833
1981 !1981,* 1984,* 1988,* 1989,* 1994*, 2012*

05A-04W-08YA-08YW !5
Green Bay Packers‡*
04W-05A-08YW-08YA !4
01L-05A-21YL-08YA !1
.800
1966 !1966,‡ 1967,‡ 1996,* 1997,* 2010*

05A-04W-07YA-07YW !5
New York Giants*
04W-05A-07YW-07YA !4
01L-05A-18YL-07YA !1
.800
1986 !1986,* 1990,* 2000,* 2007,* 2011*

05A-03W-27YA-27YW !5
Washington Redskins*
03W-05A-27YW-27YA !3
02L-05A-35YL-27YA !2
.600
1972 !1972,* 1982,* 1983,* 1987,* 1991*

05A-03W-16YA-35YW !5
Los Angeles/Oakland Raiders^†
03W-05A-35YW-16YA !3
02L-05A-16YL-16YA !2
.600
1967,^ 1976,† 1980,† 1983,† 2002†

05A-02W-34YA-45YW !5
Miami Dolphins†
02W-05A-45YW-34YA !2
03L-05A-34YL-34YA !3
.400
1971 !1971,† 1972,† 1973,† 1982,† 1984†

04A-02W-09YA-12YW !4
Baltimore/Indianapolis Colts‡†[note 6]
02W-04A-12YW-09YA !2
02L-04A-09YL-09YA !2
.500
1968 !1968,‡ 1970,† 2006,† 2009†

04A-00W-42YA-53YW !4
Minnesota Vikings‡*
00W-04A-53YW-25YA !0
04L-04A-42YL-42YA !4
.000
1969 !1969,‡ 1973,* 1974,* 1976*

04A-00W-25YA-53YW !4
Buffalo Bills†
00W-04A-53YW-25YA !0
04L-04A-25YL-25YA !4
.000
1990 !1990,† 1991,† 1992,† 1993†

03A-01W-17YA-19YW !3
St. Louis/Los Angeles Rams*
01W-03A-19YW-17YA !1
02L-03A-17YL-17YA !2
.333
1979 !1979,* 1999,* 2001*

03A-01W-03YA-04YW !3
Seattle Seahawks*
01W-03A-04YW-03YA !1
02L-03A-03YL-03YA !2
.333
2005 !2005,* 2013,* 2014*

03A-01W-01YA-01YW !3
Philadelphia Eagles*
01W-03A-01YW-01YA !1
02L-03A-14YL-01YA !2
.333
1980 !1980,* 2004,* 2017*

02A-02W-06YA-06YW !2
Baltimore Ravens†[note 7]
02W-02A-06YW-06YA !2
00L-02A-22YL-06YA !0
1.000
2000 !2000,† 2012†

02A-01W-49YA-49YW !2
Kansas City Chiefs^†
01W-02A-49YW-49YA !1
01L-02A-52YL-49YA !1
.500
1966 !1966,^ 1969^

02A-01W-12YA-33YW !2
Chicago Bears*
01W-02A-33YW-12YA !1
01L-02A-12YL-12YA !1
.500
1985 !1985,* 2006*

02A-00W-30YA-53YW !2
Cincinnati Bengals†
00W-02A-53YW-30YA !0
02L-02A-30YL-30YA !2
.000
1981 !1981,† 1988†

02A-00W-03YA-23YW !2
Carolina Panthers*
00W-02A-23YW-03YA !0
02L-02A-03YL-03YA !2
.000
2003 !2003,* 2015*

02A-00W-02YA-53YW !2
Atlanta Falcons*
00W-02A-53YW-02YA !0
02L-02A-02YL-02YA !2
.000
1998 !1998,* 2016*

01A-01W-50YA-50YW !1
New York Jets^†
01W-01A-50YW-50YA !1
00L-01A-53YL-50YA !0
1.000
1968 !1968^

01A-01W-18YA-18YW !1
Tampa Bay Buccaneers*
01W-01A-18YW-18YA !1
00L-01A-44YL-18YA !0
1.000
2002 !2002*

01A-01W-09YA-09YW !1
New Orleans Saints*
01W-01A-09YW-09YA !1
00L-01A-52YL-09YA !0
1.000
2009 !2009*

01A-00W-24YA-53YW !1
San Diego/Los Angeles Chargers†
00W-01A-53YW-24YA !0
01L-01A-24YL-24YA !1
.000
1994 !1994†

01A-00W-19YA-53YW !1
Houston/Tennessee Oilers/Tennessee Titans†
00W-01A-53YW-19YA !0
01L-01A-19YL-19YA !1
.000
1999 !1999†

01A-00W-10YA-53YW !1
St. Louis/Arizona Cardinals*
00W-01A-53YW-10YA !0
01L-01A-10YL-10YA !1
.000
2008 !2008*

00A-00W-53YA-53YW-11CG !0
Cleveland Browns†[note 6][note 7]
00W-00A-53YW-53YA-11CG !0
00L-00A-53YL-53YA-11CG !0
–
none

00A-00W-53YA-53YW-05CG !0
Detroit Lions*
00W-00A-53YW-53YA-05CG !0
00L-00A-53YL-53YA-05CG !0
–
none

00A-00W-23YA-23YW-00CG !0
Jacksonville Jaguars†
00W-00A-23YW-23YA-00CG !0
00L-00A-23YL-23YA-00CG !0
–
none

00A-00W-16YA-16YW-00CG !0
Houston Texans†
00W-00A-16YW-16YA-00CG !0
00L-00A-16YL-16YA-00CG !0
–
none

text: Teams with no Super Bowl appearances

text: Four current teams have never reached the Super Bowl. Two of them held NFL league championships prior to Super Bowl I in the 1966 NFL season:

text:
Cleveland Browns, NFL champions four times in 1950, 1954, 1955, and 1964; appeared in seven other NFL championship games in 1951, 1952, 1953, 1957, 1965, 1968, and 1969; and appeared in three AFC Championship Games in 1986, 1987, and 1989.[68] The Browns are officially viewed as one continuous franchise that began in 1946 as a member of the All-America Football Conference, joined the NFL in 1950, suspended operations from 1996 to 1998, and resumed play in 1999.[69] The Baltimore Ravens were created as an expansion team with former Browns players in 1996, and have since won two Super Bowls.[70]
Detroit Lions, NFL champions four times in 1935, 1952, 1953, and 1957; appeared in one other NFL Championship Game in 1954; and appeared in one NFC Championship Game in 1991[71]
Jacksonville Jaguars, 1995 expansion team; appeared in three AFC Championship Games in 1996, 1999, and 2017.[72]
Houston Texans, 2002 expansion team; Divisional Round appearances in 2011, 2012, and 2016 seasons.

text: In addition, Detroit, Houston, and Jacksonville have hosted Super Bowls, making Cleveland the only current NFL city that has neither hosted nor had its team play in a Super Bowl.

text: Teams with long Super Bowl droughts

text: Although Jacksonville and Houston have never appeared in a Super Bowl, there are teams whose most recent Super Bowl appearance is older than when Jacksonville and Houston joined the NFL (1995 and 2002, respectively), resulting in longer Super Bowl droughts than these teams for the following eight teams.

text: Two of these teams have not appeared in the Super Bowl since before the AFL–NFL merger in 1970:[73]

text:
New York Jets (most recently appeared in Super Bowl III, 1968 season)
Kansas City Chiefs (Super Bowl IV in 1969 season)

text: However, the Jets and the Chiefs are the only non-NFL teams to win the Super Bowl, both being members of the now-defunct AFL at the time.

text: The most recent Super Bowl appearance for the following teams was after the AFL–NFL merger, but prior to the 1995 regular season:

text:
Minnesota Vikings (Super Bowl XI, 1976 season)
Miami Dolphins (Super Bowl XIX, 1984 season)
Cincinnati Bengals (Super Bowl XXIII, 1988 season)
Washington Redskins (Super Bowl XXVI, 1991 season)
Buffalo Bills (Super Bowl XXVIII, 1993 season)
Los Angeles Chargers (played as San Diego Chargers in Super Bowl XXIX, 1994 season)

text: Teams with Super Bowl appearances but no victories

text: Eight teams have appeared in the Super Bowl without ever winning. In descending order of number of appearances, they are:

text:
Minnesota Vikings (4), appeared in Super Bowls IV, VIII, IX, and XI. They won the NFL Championship Game in 1969, the last year before the AFL–NFL merger, but failed to win the subsequent Super Bowl. An NFL expansion team in 1961, they have no pre-Super Bowl league championships.
Buffalo Bills (4), appeared in Super Bowls XXV, XXVI, XXVII, and XXVIII. Their second and last AFL championship was in 1965, the season before the first Super Bowl.
Cincinnati Bengals (2), appeared in Super Bowls XVI and XXIII. An AFL expansion team in 1968, they have no pre-Super Bowl league championships.
Atlanta Falcons (2), appeared in Super Bowls XXXIII and LI. An expansion team in 1966, they have no pre-Super Bowl league championships.
Carolina Panthers (2), appeared in Super Bowls XXXVIII and 50. A post-merger expansion team, their first season was in 1995.
Arizona Cardinals (1), appeared in Super Bowl XLIII. Their last championship was in 1947 as the Chicago Cardinals.
Los Angeles Chargers (1), appeared in Super Bowl XXIX as the San Diego Chargers. Their only AFL championship was in 1963.
Tennessee Titans (1), appeared in Super Bowl XXXIV. They won the first two AFL Championships in 1960 and 1961 as the Houston Oilers.

text: Super Bowl rematches

text: The following teams have faced each other more than once in the Super Bowl:

text:
Dallas Cowboys and Pittsburgh Steelers (3) – Super Bowls X and XIII were won by Pittsburgh, and Super Bowl XXX was won by Dallas. See also Cowboys–Steelers rivalry.
Miami Dolphins and Washington Redskins (2) – Super Bowl VII was won by Miami, and Super Bowl XVII was won by Washington.
Cincinnati Bengals and San Francisco 49ers (2) – Super Bowls XVI and XXIII were both won by San Francisco.
Buffalo Bills and Dallas Cowboys (2) – Super Bowls XXVII and XXVIII, the only rematch in consecutive seasons, were both won by Dallas.
New England Patriots and New York Giants (2) – Super Bowls XLII and XLVI were both won by New York.
New England Patriots and Philadelphia Eagles (2) – Super Bowl XXXIX was won by New England, Super Bowl LII was won by Philadelphia.


document_title: To Build a Fire

question_text: what does the dog do after the man dies

question_tokens: what does the dog do after the man dies

text: To Build a Fire

text: Summary of 1908 Story[edit]

text: On an extremely cold winter day (−75 °F or −59 °C), an unnamed man and his native wolf-dog go on the Yukon Trail after being warned of the dangers of traveling alone in extreme weather conditions by an old man from Sulfur Creek. With nine hours of hiking ahead of him, the man is expecting to meet his associates ("the boys") at a camp in Henderson Creek by that evening. The man is accompanied only by his dog, whose instincts tell it that the weather is too cold for traveling. However, the weather does not deter the man, a relative newcomer to the Yukon, even though the water vapor in the man's exhaled breaths and the saliva from the tobacco he is chewing have frozen his mouth shut. As the man hikes along a creek, he takes care to avoid pockets of unfrozen water hidden beneath thin layers of ice. He stops and builds a fire to thaw out so he can eat his lunch, and soon after continues hiking. Shortly thereafter, he breaks through the ice and soaks his feet and lower legs up to his knees.

text: More angry over the accident than concerned for his safety, the man builds a fire under a tree to dry his clothes as sensation begins to fade from his extremities. He pulls twigs from the nearby underbrush to feed the fire, but the resulting vibrations eventually cause the snow on the tree's loaded boughs to tumble down, extinguishing the flames and frightening the man for the first time. He gathers material for a new fire and lights it with great difficulty, burning himself with his matches in the process. However, while trying to remove a piece of moss, he inadvertently disturbs and extinguishes the flame. He seizes hold of the dog, planning to kill it and use the fresh carcass for warmth; however, he finds that he can neither draw his knife nor strangle the animal with his frozen hands. In a final desperate attempt to warm himself up, the man tries to run along the trail but repeatedly stumbles and falls. Finally understanding the truth of the old man's warnings about the cold, the man succumbs to hypothermia and sleeps his way into death, imagining himself to be with "the boys" as they find his body the next day.

text: The dog does not understand the situation at first, but after it catches the smell of death, it howls for a while and then trots off toward the camp, where it knows it can get food and fire.[2]

text: Themes[edit]

text: Man vs. Nature is one of the themes present in this short story. The protagonist decides to face the brutal cold temperatures of the Yukon Territory, despite being warned by an older man. The short story depicts the protagonist's battle of life and death while highlighting the importance of the fire.

text: One theme illustrated in the story is the man's human sense of judgment contrasted with the dog's animal instincts. Throughout the story, London hints that the dog has more knowledge of survival than the man. The judgment-versus-instinct theme is evident when the man builds the first fire. While the dog wants to stay by the fire to keep warm, the man is determined to keep moving. As the dog reluctantly follows the man across a frozen river, the dog is more cautious than the man.

text: The protagonist's desperation is evident throughout the majority of the story. It is noticeable soon after the man falls into a frozen-over river. In order to save himself, he scrambles to build a fire but is too busy worrying about his health to notice the mistake of building a fire underneath a tree which has collected an enormous amount of snow. After the first fire is put out, his desperation becomes more defined as he seemingly will do anything to survive, including attempting to kill his dog for warmth and using all his matches at once in a final attempt to light his last fire. His desperation for survival and his fear of death cause his final demise as he freezes to death at the end of the story.

text: Another evident theme in the story is Perseverance. Although the man makes several mistakes and is getting frostbite in his fingers and toes, he continues to fight for survival.

text: Stupidity and arrogance are personified in the story's protagonist. For example, he goes through the extremely cold territory alone, despite going for the first time. He laughs off the crucial advice of traveling with an acquaintance because he thinks he knows what he's doing. This arrogance results in the protagonist putting himself in a dangerous situation that was preventable. At first, he thinks it's nothing and that everything will be fine. By the end of the story, he dies as a result of his arrogance. Another illustration of arrogance occurs when the protagonist disregards the possibility that there may be situations he cannot overcome. The old man warns the protagonist of this and also seems to have a better understanding of the natural world, respecting the fact that there are some situations the man will be unable to control. Not only does the old man see the protagonist's stupidity, but the dog notices the man's lack of knowledge about the terrain and its obstacles after he fails to keep a fire going.

text: Succumbing to death is another theme in the story: more specifically the peace that may be found in death. London foreshadows the death of the man early in the story, so it is not a surprise that the man dies. However, London depicts the death quite differently than many other authors do. The man drifts off into a calm, peaceful slumber devoid of suffering and pain. London's use of relaxing words dissuades the reader from feeling a great deal of sympathy for the man, as the death is merciful and graciously anticipated, rather than sad. In contrast to more dramatic depictions of death, London's depiction reveals death as a peaceful escape from tumult and pain.

text: 1902 Version[edit]

text: The earlier version was first published in The Youth's Companion on May 29, 1902. It differs in some details, though the general structure and storyline are similar; the primary differences are as follows: in the first version it is not as cold, there is no dog, the fire is not doused, and the man (named Tom Vincent) suffers some permanent frostbite damage but survives, sadder but wiser.[3] In the ending of the story as well, the man or Tom Vincent, eventually got to his companions at the other camp. While also eventually regaining feeling in both his hands and his feet after obtaining frostbite.[4]

text: Films[edit]

text:
Construire un feu (1927-1928) is an early short film by Claude Autant-Lara.[5]
To Build a Fire (1969) was made by David Cobham, with Ian Hogg as the man and Orson Welles as the narrator.[6]
To Build a Fire (2003) is a French version starring Olivier Pagès.[7]
To Build a Fire (2008) is an American version with a modified story.[8]
To Build a Fire (2016) is an animated short film directed by Fx Goby.[9]

text: See Also[edit]

text:
"The Little Match Girl", a short story by Hans Christian Andersen about a child dying of hypothermia
"The Beggar Boy at Christ's Christmas Tree" (1876), a short story by Fyodor Dostoevsky