Open Set of Algorithmic Characters RENTARO YOSHIOKA, YUTAKA WATANOBE and NIKOLAY MIRENKOV Department of Computer Science and Engineering University of Aizu Aizu-wakamatsu, Fukushima 965-8580 JAPAN rentaro@u-aizu.ac.jp, yutaka@u-aizu.ac.jp, nikmir@u-aizu.ac.jp Abstract: Programming in pictures (or filmification of methods) is an approach where pictures and moving pictures are used as (super-) characters to represent algorithms. There are two types of pictures. Compound pictures define algorithmic steps and generic pictures define the contents of compound pictures. In this paper we focus on generic pictures by providing their overview, classification and examples. We also show how the syntax-semantic gap can be bridged by the pictures and how the readability and understandability of picture-based programs are realized. In addition, the scalability of computation represented by the super-characters and the expandability of these character sets are considered. Key-Words: CyberFilm, Filmification, Algorithmic Characters, Programming Language, Algorithms, Pictures 1 Introduction For ancient people, drawing pictures to represent objects and actions was a “natural technique.” Pictures were easy to understand. However, available technology at the time was insufficient to support this technique. Step by step, picture languages were replaced by languages where signs represented not objects and actions but syllables, phonemes, and sometimes words. Ancient hieroglyphs were transformed into new hieroglyphs and characters for demonic handwriting. As a result, current writing systems are in principle the representation of spoken languages rather than a direct representation of data/knowledge. We can only imagine what characters would have been introduced if people, 20-30 thousand years ago, possessed computers of the current level. In any case, one of the main imperfections of the sign system evolution is the great gap between sign expression syntax and corresponding semantics. So, it is evident that a new system of signs and abstraction that can bridge the gap between syntax and semantics is necessary, and that such system of signs should take the features of the real world, human beings and modern technologies into account. LabVIEW programming environment from National Instruments [1] and Algorithmic Alphabet from Sentrana [2] are good illustrations. For promoting such necessity we are also developing a new system of characters (we call them super-characters) and special constructs to represent algorithms. An algorithm is considered in the traditional manner: as a precise plan of actions specifying how to solve some problem. Usually such a plan is based on a finite set of instructions and constructs defining a partial order of execution of instructions. Though our focus is primarily on computational algorithms that begin with input values and yield output values in a limited number of steps, we consider the plan of actions as a set of answers to the where, when, what, why and how of the action to be done. This means that in addition to conventional constructs of programming languages, we must consider new forms of representation/specification to realize algorithm readability and understandability. To answer the above mentioned questions, we consider algorithms as activity in 4-dimensional space-time. To define an algorithm, a space of activity, which is some structure (specified by their shapes and sizes) and their possible combinations, as well as attributes (parameters) representing the space (subspace) states is defined. Then activities of traversal schemes within the space structures are defined and concrete computational operations related to the traversal schemes are defined. Finally, we specify input-output operations representing (displaying) initial, final and possibly intermediate states of the space structures (substructures). All these specifications are arranged into four sets of compound pictures (algorithmic cyberFrames) and the sets are arranged into an algorithmic cyberFilm. SELECTED TOPICS in APPLIED COMPUTER SCIENCE ISSN: 1792-4863 327 ISBN: 978-960-474-231-8