|
English Electric DEUCE
The DEUCE (''Digital Electronic Universal Computing Engine'') was one of the earliest United Kingdom, British commercially available computers, built by English Electric from 1955. It was the production version of the Pilot ACE, itself a cut-down version of Alan Turing's Automatic Computing Engine, ACE. Hardware description The DEUCE had 1450 thermionic valves, and used mercury (element), mercury delay-line memory, delay lines for its main memory; each of the 12 delay lines could store 32 instructions or data words of 32 bits each. It adopted the then high 1 megahertz clock rate of the Pilot ACE. Input/output was via Hollerith 80-column punch-card equipment. The reader read cards at the rate of 200 per minute, while the card punch rate was 100 cards per minute. The DEUCE also had an 8192-word magnetic drum for main storage. To access any of the 256 tracks of 32 words, the drum had one group of 16 read and one group of 16 write heads, each group on indepen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
English Electric
N.º UIC: 9094 110 1449-3 (Takargo Rail) The English Electric Company Limited (EE) was a British industrial manufacturer formed after the Armistice of 11 November 1918, armistice of World War I by amalgamating five businesses which, during the war, had been making munitions, armaments and aeroplanes. It initially specialised in industrial electric motors and transformers, railway locomotives and traction equipment, diesel motors and steam turbines. Its activities were later expanded to include consumer electronics, nuclear reactors, guided missiles, military aircraft and mainframe computers. Two English Electric aircraft designs became landmarks in British aeronautical engineering; the Canberra and the Lightning. In 1960, English Electric Aircraft (40%) merged with Vickers (40%) and Bristol (20%) to form British Aircraft Corporation. In 1968 English Electric's operations were merged with GEC's, the combined business employing more than 250,000 people. Foundation Aiming ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of New South Wales
The University of New South Wales (UNSW), also known as UNSW Sydney, is a public research university based in Sydney, New South Wales, Australia. It is one of the founding members of Group of Eight, a coalition of Australian research-intensive universities. Established in 1949, UNSW is a research university, ranked 44th in the world in the 2021 ''QS World University Rankings'' and 67th in the world in the 2021 ''Times Higher Education World University Rankings''. It is one of the members of Universitas 21, a global network of research universities. It has international exchange and research partnerships with over 200 universities around the world. According to the 2021 QS World University Rankings by Subject, UNSW is ranked top 20 in the world for Law, Accounting and Finance, and 1st in Australia for Mathematics, Engineering and Technology. UNSW is also one of the leading Australian universities in Medicine, where the median ATAR (Australian university entrance examination re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Optimum Programming
In the history of computing, optimum programming, or optimum coding is the practice of arranging a computer program's instructions in memory so as to minimize the time the machine spends waiting for instructions. It is of historical interest mainly due to the design of many early digital computers. Most early computers used some form of serial memory, primarily delay-line memory or magnetic drums. Unlike the random-access memory of modern computers, words in serial memory are made available one at a time; the time required to access a particular word depends on the "distance" between it and the word currently being read. If a given delay line held ''n'' words, the average time to read a word would be ''n''/2 word times. Without optimum coding, such a machine would spend most of its time idly waiting for instructions and data. To circumvent this problem, many machines, particularly Alan Turing's ACE and its descendants, included a field specifying the address of the next instruction ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Algebra
Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions. Linear algebra is also used in most sciences and fields of engineering, because it allows modeling many natural phenomena, and computing efficiently with such models. For nonlinear systems, which cannot be modeled with linear algebra, it is often used for dealing with first-order approximations, using the fact that the differential of a multivariate function at a point is the linear ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reverse Polish Notation
Reverse Polish notation (RPN), also known as reverse Łukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators ''follow'' their operands, in contrast to Polish notation (PN), in which operators ''precede'' their operands. It does not need any parentheses as long as each operator has a fixed number of operands. The description "Polish" refers to the nationality of logician Jan Łukasiewicz, who invented Polish notation in 1924. The first computer to use postfix notation, though it long remained essentially unknown outside of Germany, was Konrad Zuse's Z3 in 1941 as well as his Z4 in 1945. The reverse Polish scheme was again proposed in 1954 by Arthur Burks, Don Warren, and Jesse Wright and was independently reinvented by Friedrich L. Bauer and Edsger W. Dijkstra in the early 1960s to reduce computer memory access and use the stack to evaluate expressions. The algorithms and notation for this scheme were extended ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Charles Leonard Hamblin
Charles Leonard Hamblin (20 November 1922 – 14 May 1985) was an Australian philosopher, logician, and computer pioneer, as well as a professor of philosophy at the New South Wales University of Technology (now the University of New South Wales) in Sydney. Among his most well-known achievements in the area of computer science was the introduction of Reverse Polish Notation and the use in 1957 of a push-down pop-up stack. This preceded the work of Friedrich Ludwig Bauer and Klaus Samelson on use of a push-pop stack. The stack had been invented by Alan Turing in 1946 when he introduced such a stack in his design of the ACE computer. In philosophy, Hamblin is known for his book ''Fallacies'', a standard work in the area of the false conclusions in logic. In formal semantics, Hamblin is known for his computational model of discourse Discourse is a generalization of the notion of a conversation to any form of communication. Discourse is a major topic in social theory, with work ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Assembler Language
In computer programming, assembly language (or assembler language, or symbolic machine code), often referred to simply as Assembly and commonly abbreviated as ASM or asm, is any low-level programming language with a very strong correspondence between the instructions in the language and the architecture's machine code instructions. Assembly language usually has one statement per machine instruction (1:1), but constants, comments, assembler directives, symbolic labels of, e.g., memory locations, registers, and macros are generally also supported. The first assembly code in which a language is used to represent machine code instructions is found in Kathleen and Andrew Donald Booth's 1947 work, ''Coding for A.R.C.''. Assembly code is converted into executable machine code by a utility program referred to as an ''assembler''. The term "assembler" is generally attributed to Wilkes, Wheeler and Gill in their 1951 book ''The Preparation of Programs for an Electronic Digital Com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brian Randell
Brian Randell (born 1936) is a British computer scientist, and Emeritus Professor at the School of Computing, Newcastle University, United Kingdom. He specialises in research into software fault tolerance and dependability, and is a noted authority on the early pre-1950 history of computing hardware. Biography Randell was employed at English Electric from 1957 to 1964 where he was working on compilers. His work on ALGOL 60 is particularly well known, including the development of the Whetstone compiler for the English Electric KDF9, an early stack machine. In 1964, he joined IBM, where he worked at the Thomas J. Watson Research Center on high performance computer architectures and also on operating system design methodology. In May 1969, he became a Professor of Computing Science at the then named University of Newcastle upon Tyne, where he has worked since then in the area of software fault tolerance and dependability. He is a member of the Special Interest Group on Compute ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ALGOL
ALGOL (; short for "Algorithmic Language") is a family of imperative computer programming languages originally developed in 1958. ALGOL heavily influenced many other languages and was the standard method for algorithm description used by the Association for Computing Machinery (ACM) in textbooks and academic sources for more than thirty years. In the sense that the syntax of most modern languages is "Algol-like", it was arguably more influential than three other high-level programming languages among which it was roughly contemporary: FORTRAN, Lisp, and COBOL. It was designed to avoid some of the perceived problems with FORTRAN and eventually gave rise to many other programming languages, including PL/I, Simula, BCPL, B, Pascal, and C. ALGOL introduced code blocks and the begin...end pairs for delimiting them. It was also the first language implementing nested function definitions with lexical scope. Moreover, it was the first programming language which gave detail ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
GEORGE (programming Language)
GEORGE (General Order Generator) is a programming language invented by Charles Leonard Hamblin in 1957. It was designed around a push-down pop-up stack for arithmetic operations, and employed reverse Polish notation. The language included loops, subroutines, conditionals, vectors, and matrices. Algebraic expressions were written in reverse Polish notation; thus, a + b was written a b +, and similarly for the other arithmetic operations of subtraction, multiplication, and division. The algebraic expression ax^2 + bx + c was written a x dup × × b x × + c +, where 'dup' meant 'duplicate the value'. Following the reverse Polish form, an assignment statement to evaluate the formula y = ax^2 + bx + c was written as a x dup × × b x × + c + (y). The computer evaluated the expression as follows: the values of a, then x, were pushed onto the top of the accumulator stack; 'dup' caused a copy of the top-most value (x) to be pushed onto the top of the accumulator stack; Multiply ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
High-level Programming Language
In computer science, a high-level programming language is a programming language with strong Abstraction (computer science), abstraction from the details of the computer. In contrast to low-level programming languages, it may use natural language ''elements'', be easier to use, or may automate (or even hide entirely) significant areas of computing systems (e.g. memory management), making the process of developing a program simpler and more understandable than when using a lower-level language. The amount of abstraction provided defines how "high-level" a programming language is. In the 1960s, a high-level programming language using a compiler was commonly called an ''autocode''. Examples of autocodes are COBOL and Fortran. The first high-level programming language designed for computers was Plankalkül, created by Konrad Zuse. However, it was not implemented in his time, and his original contributions were largely isolated from other developments due to World War II, aside from th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary-coded Decimal
In computing and electronic systems, binary-coded decimal (BCD) is a class of binary encodings of decimal numbers where each digit is represented by a fixed number of bits, usually four or eight. Sometimes, special bit patterns are used for a sign or other indications (e.g. error or overflow). In byte-oriented systems (i.e. most modern computers), the term ''unpacked'' BCD usually implies a full byte for each digit (often including a sign), whereas ''packed'' BCD typically encodes two digits within a single byte by taking advantage of the fact that four bits are enough to represent the range 0 to 9. The precise 4-bit encoding, however, may vary for technical reasons (e.g. Excess-3). The ten states representing a BCD digit are sometimes called '' tetrades'' (for the nibble typically needed to hold them is also known as a tetrade) while the unused, don't care-states are named , ''pseudo-decimals'' or ''pseudo-decimal digits''. BCD's main virtue, in comparison to binary posit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> English Electric")
