Algorithms with Possibilities of Selflearning and Selfmodification

1983 ◽  
Vol 6 (1) ◽  
pp. 1-44
Author(s):  
Eugeniusz Eberbach

This paper concerns a concept of selfperfecting and selflearning of digital computer systems. This idea is not new, but continuously in the state of elaborations. Such systems, i.e. with a possibility of selflearning and selfmodification would have undoubtedly greater possibilities and elastic properties in their behaviour than traditional digital systems. In the paper a digital system is treated as a complex system of algorithms. As an abstract model of real algorithms. so called Mazurkiewicz FC-algorithm is considered. FC-algorithms used in the paper have been extended to modifiable Fe-algorithms by adding a time-variant structure and the use of the notion of tolerance spaces. This structure allowed us to introduce a model of learning for modifiable FC-algorithms. Learning is understood as a goal directed process of changes of activities on the basis of experience.

2021 ◽  
Vol 27 (7) ◽  
pp. 339-349
Author(s):  
A. D. Ivannikov ◽  

The simulation of control digital systems at the architecture level, that is, emulation of the instruction set, memory cells and internal programmable registers, as well as the interrupt system and direct memory access is considered. Emulators are used for debugging embedded digital system software and in the development of new custom processors. Requirements for emulators are formalized. It is shown that the main requirements are adequate simulation of digital systems at the architecture level, the presence of a set of convenient debugging modes, as well as high efficiency of emulators, that is, the minimum possible average number of instrumental computer instructions required to simulate one instruction of the target digital system. A classification of the debugging capabilities of emulators and possible ways of implementing debugging modes is given. The composition of the emulators is described. A graphical model of the structure of the emulator is proposed. The simulation process for each instruction is presented as a sequence of execution of smaller operations. If different instructions include the same operations, these operations can be performed by the same software modules. These modules can be included in all the corresponding blocks of the emulator that simulate the execution of instructions, or the emulator can include only one copy of each operational program module, and the module can be accessed while simulating the corresponding instruction. Determination of the structure of the emulator is formalized as an extreme task, the objective function of which is the minimum average time for simulating the execution of one instruction of the target digital system, and the limitation is the maximum allowable memory size of the instrumental computer occupied by the emulator. A practical method for determining the structure of the emulator is proposed.


Author(s):  
David Colander ◽  
Roland Kupers

This chapter tells the story of how macroeconomics developed as a separate field in an attempt to add aspects of complexity to the standard model with the aim of improving policy advice, but how those aspects of complexity were quickly lost it again. Instead of dealing with the macro economy as a complex system, macro economists focused on dotting is and crossing ts. The chapter begins by clarifying the difference between macroeconomics and microeconomics. Microeconomics builds a theory up from the individual elements—from the micro level to the macro level. It starts from assumptions of rational individuals and then analyzes how they would coordinate their actions, and what role the state should play in that coordination. Macroeconomics developed as a separate branch of economics when J. M. Keynes’s work was integrated into formal models in the 1930s and 1940s.


1974 ◽  
Vol 17 (4) ◽  
pp. 364-364
Author(s):  
M. M. Lehman

Sign in / Sign up

Export Citation Format

Share Document