{"id":{"repo_id":"baylor","oai_identifier":"oai:baylor-ir.tdl.org:2104/8829"},"canonical_url":"https://search.dev.ndltd.org/etd/baylor/oai:baylor-ir.tdl.org:2104/8829","repository":{"repo_id":"baylor","name":"Baylor University","base_url":"https://baylor-ir.tdl.org/server/oai/request"},"display":{"title":"Algorithmic specified complexity.","abstract":"Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of improbability as information. But not all improbable events convey information. Kolmogorov complexity captures the idea of information as something easily described. But not all easily described objects are information. The proposed Algorithmic Specified Complexity takes into account both Shannon Information and Kolmogorov complexity to gain a fuller evaluation of information. We demonstrate this concept and develop several examples. We show the low probability of high Algorithmic Specified Complexity. We apply the concept to both images and functional machines from the Game of Life.","abstract_html":"Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of improbability as information. But not all improbable events convey information. Kolmogorov complexity captures the idea of information as something easily described. But not all easily described objects are information. The proposed Algorithmic Specified Complexity takes into account both Shannon Information and Kolmogorov complexity to gain a fuller evaluation of information. We demonstrate this concept and develop several examples. We show the low probability of high Algorithmic Specified Complexity. We apply the concept to both images and functional machines from the Game of Life.","abstract_has_math":false,"creators":["Ewert, Winston."],"institution":"Baylor University.","degree_name":"Ph.D.","degree_level":"Doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Marks, Robert J., II (Robert Jackson), 1950-"],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-09","date_published":"2013-09","updated_at":"2026-07-24T01:07:52Z","subjects":["Information.","Algorithmic specified complexity.","Kolmogorov complexity."],"languages":["en"],"rights":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2104/8829","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Marks, Robert J., II (Robert Jackson), 1950-"]},{"key":"dc:creator","label":"Author","values":["Ewert, Winston."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-09-24T14:18:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-09-24T14:18:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2013-09"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Baylor University."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Information.","Algorithmic specified complexity.","Kolmogorov complexity."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2104/8829"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of improbability as information. But not all improbable events convey information. Kolmogorov complexity captures the idea of information as something easily described. But not all easily described objects are information. The proposed Algorithmic Specified Complexity takes into account both Shannon Information and Kolmogorov complexity to gain a fuller evaluation of information. We demonstrate this concept and develop several examples. We show the low probability of high Algorithmic Specified Complexity. We apply the concept to both images and functional machines from the Game of Life."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Algorithmic specified complexity."]}]}],"canonical_facts":{"dc:contributor.advisor":["Marks, Robert J., II (Robert Jackson), 1950-"],"dc:creator":["Ewert, Winston."],"dc:date.accessioned":["2013-09-24T14:18:50Z"],"dc:date.available":["2013-09-24T14:18:50Z"],"dc:date.issued":["2013-09"],"dc:description.abstract":["Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of improbability as information. But not all improbable events convey information. Kolmogorov complexity captures the idea of information as something easily described. But not all easily described objects are information. The proposed Algorithmic Specified Complexity takes into account both Shannon Information and Kolmogorov complexity to gain a fuller evaluation of information. We demonstrate this concept and develop several examples. We show the low probability of high Algorithmic Specified Complexity. We apply the concept to both images and functional machines from the Game of Life."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/2104/8829"],"dc:language.iso":["en"],"dc:rights":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."],"dc:subject":["Information.","Algorithmic specified complexity.","Kolmogorov complexity."],"dc:title":["Algorithmic specified complexity."],"dc:type":["Thesis"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["Baylor University."]},"updated_at":"2026-07-24T01:07:52Z"}