A Characterization of the Computational Power of Rule-based ...
Washington University in St. Louis
Washington University Open Scholarship All Computer Science and Engineering Research
Computer Science and Engineering
Report Number: WUCS-93-15 1993-01-01
A Characterization of the Computational Power of Rule-based Visualization Authors: Kenneth C. Cox and Gruia-Catalin Roman Declarative visualization is a paradigm in which the process of visualization is treated as a mapping from some domain (typically a program) to an image. One means of declaring such mappings is through the use of rules which specify the relationship between the domain and the image. This paper examines the computational power of such rule-based mappings. Computational power is measure using three separate criteria. The first of these uses the Chomsky hierarchy, in which computational power is treated as string-acceptance; with this criterion we are able to show that certain rule-based models are equivalent in power to Turing machines. The second criterion is the evaluation of recursive functions, while the third is a more informal consideration of the abstractive capabilities of the mapping.
Follow this and additional works at: http://openscholarship.wustl.edu/cse_research Part of the Computer Engineering Commons, and the Computer Sciences Commons Recommended Citation Cox, Kenneth C. and Roman, Gruia-Catalin, "A Characterization of the Computational Power of Rule-based Visualization" Report Number: WUCS-93-15 (1993). All Computer Science and Engineering Research. http://openscholarship.wustl.edu/cse_research/302
Department of Computer Science & Engineering - Washington University in St. Louis Campus Box 1045 - St. Louis, MO - 63130 - ph: (314) 935-6160.
Washington University Open Scholarship All Computer Science and Engineering Research
Computer Science and Engineering
Report Number: WUCS-93-15 1993-01-01
A Characterization of the Computational Power of Rule-based Visualization Authors: Kenneth C. Cox and Gruia-Catalin Roman Declarative visualization is a paradigm in which the process of visualization is treated as a mapping from some domain (typically a program) to an image. One means of declaring such mappings is through the use of rules which specify the relationship between the domain and the image. This paper examines the computational power of such rule-based mappings. Computational power is measure using three separate criteria. The first of these uses the Chomsky hierarchy, in which computational power is treated as string-acceptance; with this criterion we are able to show that certain rule-based models are equivalent in power to Turing machines. The second criterion is the evaluation of recursive functions, while the third is a more informal consideration of the abstractive capabilities of the mapping.
Follow this and additional works at: http://openscholarship.wustl.edu/cse_research Part of the Computer Engineering Commons, and the Computer Sciences Commons Recommended Citation Cox, Kenneth C. and Roman, Gruia-Catalin, "A Characterization of the Computational Power of Rule-based Visualization" Report Number: WUCS-93-15 (1993). All Computer Science and Engineering Research. http://openscholarship.wustl.edu/cse_research/302
Department of Computer Science & Engineering - Washington University in St. Louis Campus Box 1045 - St. Louis, MO - 63130 - ph: (314) 935-6160.
