Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks

Thumbnail Image
Date
2011-01-01
Authors
Patterson, Brian
Major Professor
Advisor
Jack H. Lutz
James I. Lathrop
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Computer Science
Abstract

Our work is centered around topics where we provide a new model or approach to a well-known paradigm. We provide a new lens through which to view an area of research, providing access for new researchers and perspectives. After a brief orientation with common terms, we examine computation of real-valued sets, our general multi-resolution cellular automata (MRCA) simulator, how to prove languages are non-regular using Kolmogorov complexity, and how to show hidden variables are valuable in Bayesian networks.

Comments
Description
Keywords
Citation
Source
Subject Categories
Copyright
Sat Jan 01 00:00:00 UTC 2011