|
MK-52
The Elektronika MK-52 (russian: Электро́ника МК-52) is an RPN-programmable calculator manufactured in the Soviet Union from 1983 to 1992 at the Quasar and Kvadr plants in Ukraine. It belongs to the third generation of Soviet programmable calculators. Its original selling price was 115 rubles. The MK-52 is a backwards compatible improvement to the Elektronika MK-61, the main changes being the addition of an internal non-volatile EEPROM module for permanent data storage, a diagnostic slot, and a slot for separately sold ROM modules. The machine code and functionality of the MK-52 and MK-61 calculators were extensions of the earlier MK-54, B3-34, and B3-21 Elektronika calculators. The MK-52 is the only calculator known to have internal storage in the form of an EEPROM module. As with many Soviet calculators, the MK-52 has a number of undocumented functions. In November 1988, the MK-52 went int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elektronika MK-52
The Elektronika MK-52 (russian: Электро́ника МК-52) is an RPN-programmable calculator manufactured in the Soviet Union from 1983 to 1992 at the Quasar and Kvadr plants in Ukraine. It belongs to the third generation of Soviet programmable calculators. Its original selling price was 115 rubles. The MK-52 is a backwards compatible improvement to the Elektronika MK-61, the main changes being the addition of an internal non-volatile EEPROM module for permanent data storage, a diagnostic slot, and a slot for separately sold ROM modules. The machine code and functionality of the MK-52 and MK-61 calculators were extensions of the earlier MK-54, B3-34, and B3-21 Elektronika calculators. The MK-52 is the only calculator known to have internal storage in the form of an EEPROM module. As with many Soviet calculators, the MK-52 has a number of undocumented functions. In November 1988, the MK-52 went int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
B3-34
Elektronika B3-34 (Cyrillic: Электроника Б3-34) was a Soviet programmable calculator. It was released in 1980 and was sold for 85 rubles. B3-34 used reverse Polish notation and had 98 bytes of instruction memory, four stack user registers and 14 addressable registers. Each register could store up to 8 mantissa or Significand digits and two exponent digits in the range to . The first Soviet programmable stationary calculator the ISKRA 123, using mains power, was released at the beginning of the 1970s. The first programmable battery-powered pocket calculator Elektronika B3-21 was developed by the end of 1977 and released at the beginning of 1978. Its successor, B3-34, wasn't backward compatible with B3-21. The instruction set, hardware architecture and microcode of the B3-34 defined the standard of the later Soviet programmable hand-held and office-desk calculators: , , , . Model numbers do not follow any special order: MK-54 is a slightly upgraded version of B3-34 an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Programmable Calculator
Programmable calculators are calculators that can automatically carry out a sequence of operations under control of a stored computer programming, program. Most are Turing complete, and, as such, are theoretically general-purpose computers. However, their user interfaces and programming environments are specifically tailored to make performing small-scale numerical computations convenient, rather than general-purpose use. The first programmable calculators such as the IBM CPC used punched cards or other media for program storage. Hand-held electronic calculators store programs on magnetic strips, removable read-only memory cartridges, flash memory, or in battery-backed read/write memory. Since the early 1990s, most of these flexible handheld units belong to the class of graphing calculators. Before the mass-manufacture of inexpensive dot-matrix LCDs, however, programmable calculators usually featured a one-line numeric or alphanumeric display. The Big Four manufacturers of pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MK-61
{{No footnotes, date=September 2008 The Elektronika MK-61 is a third-generation non- BASIC, RPN programmable calculator which was manufactured in the Soviet Union during the years 1983 to 1994. Its original selling price was 85 rubles. The MK-61 has 105 steps of volatile program memory and 15 memory registers. It functions using either three AA-size battery cells or a wall plug. It has a ten-digit (eight digit mantissa, two digit exponent) green vacuum fluorescent display A vacuum fluorescent display (VFD) is a display device once commonly used on consumer electronics equipment such as video cassette recorders, car radios, and microwave ovens. A VFD operates on the principle of cathodoluminescence, roughly .... Image:Main PCB front.jpg Image:Elektronika MK-61 Main PCB rear.jpg Image:Elektronika MK-61 Power PCB.jpg Image:MK-61.gif External linksDatasheet for the MK 61 processor1970s-1980s pocket calculators database [...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] |
Causality
Causality (also referred to as causation, or cause and effect) is influence by which one event, process, state, or object (''a'' ''cause'') contributes to the production of another event, process, state, or object (an ''effect'') where the cause is partly responsible for the effect, and the effect is partly dependent on the cause. In general, a process has many causes, which are also said to be ''causal factors'' for it, and all lie in its past. An effect can in turn be a cause of, or causal factor for, many other effects, which all lie in its future. Some writers have held that causality is metaphysically prior to notions of time and space. Causality is an abstraction that indicates how the world progresses. As such a basic concept, it is more apt as an explanation of other concepts of progression than as something to be explained by others more basic. The concept is like those of agency and efficacy. For this reason, a leap of intuition may be needed to grasp it. Accordin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexadecimal
In mathematics and computing, the hexadecimal (also base-16 or simply hex) numeral system is a positional numeral system that represents numbers using a radix (base) of 16. Unlike the decimal system representing numbers using 10 symbols, hexadecimal uses 16 distinct symbols, most often the symbols "0"–"9" to represent values 0 to 9, and "A"–"F" (or alternatively "a"–"f") to represent values from 10 to 15. Software developers and system designers widely use hexadecimal numbers because they provide a human-friendly representation of binary-coded values. Each hexadecimal digit represents four bits (binary digits), also known as a nibble (or nybble). For example, an 8-bit byte can have values ranging from 00000000 to 11111111 in binary form, which can be conveniently represented as 00 to FF in hexadecimal. In mathematics, a subscript is typically used to specify the base. For example, the decimal value would be expressed in hexadecimal as . In programming, a number of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Operation
In Mathematical logic, logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax (logic), syntax of propositional logic, the Binary relation, binary connective \lor can be used to join the two atomic formulas P and Q, rendering the complex formula P \lor Q . Common connectives include negation, disjunction, Logical conjunction, conjunction, and material conditional, implication. In standard systems of classical logic, these connectives are semantics of logic, interpreted as truth functions, though they receive a variety of alternative interpretations in nonclassical logics. Their classical interpretations are similar to the meanings of natural language expressions such as English language, English "not", "or", "and", and "if", but not identical. Discrepancies between natural language connectives and those of classical logic have m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exponent
Exponentiation is a mathematical operation, written as , involving two numbers, the '' base'' and the ''exponent'' or ''power'' , and pronounced as " (raised) to the (power of) ". When is a positive integer, exponentiation corresponds to repeated multiplication of the base: that is, is the product of multiplying bases: b^n = \underbrace_. The exponent is usually shown as a superscript to the right of the base. In that case, is called "''b'' raised to the ''n''th power", "''b'' (raised) to the power of ''n''", "the ''n''th power of ''b''", "''b'' to the ''n''th power", or most briefly as "''b'' to the ''n''th". Starting from the basic fact stated above that, for any positive integer n, b^n is n occurrences of b all multiplied by each other, several other properties of exponentiation directly follow. In particular: \begin b^ & = \underbrace_ \\ ex& = \underbrace_ \times \underbrace_ \\ ex& = b^n \times b^m \end In other words, when multiplying a base raised to one exp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Dis-junction
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premises in a topic-neutral way. When used as a countable noun, the term "a logic" refers to a logical formal system that articulates a proof system. Formal logic contrasts with informal logic, which is associated with informal fallacies, critical thinking, and argumentation theory. While there is no general agreement on how formal and informal logic are to be distinguished, one prominent approach associates their difference with whether the studied arguments are expressed in formal or informal languages. Logic plays a central role in multiple fields, such as philosophy, mathematics, computer science, and linguistics. Logic studies arguments, which consist of a set of premises together with a conclusion. Premises and conclusions are usually under ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Numeral System
A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method of mathematical expression which uses only two symbols: typically "0" (zero) and "1" ( one). The base-2 numeral system is a positional notation with a radix of 2. Each digit is referred to as a bit, or binary digit. Because of its straightforward implementation in digital electronic circuitry using logic gates, the binary system is used by almost all modern computers and computer-based devices, as a preferred system of use, over various other human techniques of communication, because of the simplicity of the language and the noise immunity in physical implementation. History The modern binary number system was studied in Europe in the 16th and 17th centuries by Thomas Harriot, Juan Caramuel y Lobkowitz, and Gottfried Leibniz. However, systems related to binary numbers have appeared earlier in multiple cultures including ancient Egypt, China, and India. Leibniz was specifica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Boolean Algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (''and'') denoted as ∧, disjunction (''or'') denoted as ∨, and the negation (''not'') denoted as ¬. Elementary algebra, on the other hand, uses arithmetic operators such as addition, multiplication, subtraction and division. So Boolean algebra is a formal way of describing logical operations, in the same way that elementary algebra describes numerical operations. Boolean algebra was introduced by George Boole in his first book ''The Mathematical Analysis of Logic'' (1847), and set forth more fully in his '' An Investigation of the Laws of Thought'' (1854). According to Huntington, the term "Boolean algebra" wa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
