On a Definition of the Description Complexity of Finite Systems

Nersisian A (1984). On a Definition of the Description Complexity of Finite Systems. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-84-004

[img]
Preview
Text
WP-84-004.pdf

Download (431kB) | Preview

Abstract

Most of the systems studied at IIASA are characterized by large numbers of components and by complex interactions. To minimize the problems caused by these factors it is often useful to find the most economical (minimal) representation of the system (or of the model used to describe it).

In this paper the author, a participant in the 1983 IIASA Young Scientists' Summer Program, investigates the problem of finding minimal descriptions of finite deterministic systems with a given accuracy. An algorithm for obtaining an asymptotically minimal description of discrete systems with constraints on the modeling accuracy is proposed.

Item Type: Monograph (IIASA Working Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:55
Last Modified: 18 Nov 2016 18:11
URI: http://pure.iiasa.ac.at/2514

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313