Loading…
Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?
Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict...
Saved in:
Published in: | Entropy (Basel, Switzerland) Switzerland), 2023-06, Vol.25 (6), p.903 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c469t-91d3c15dea41e37302a6de162f95f0c21f78ce3901b4f99edaddcfe8139ad5143 |
container_end_page | |
container_issue | 6 |
container_start_page | 903 |
container_title | Entropy (Basel, Switzerland) |
container_volume | 25 |
creator | Krumm, Marius Müller, Markus P |
description | Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process' behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role. |
doi_str_mv | 10.3390/e25060903 |
format | article |
fullrecord | <record><control><sourceid>gale_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_b666c34bf7fd46afa92563a7238838ff</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A758282915</galeid><doaj_id>oai_doaj_org_article_b666c34bf7fd46afa92563a7238838ff</doaj_id><sourcerecordid>A758282915</sourcerecordid><originalsourceid>FETCH-LOGICAL-c469t-91d3c15dea41e37302a6de162f95f0c21f78ce3901b4f99edaddcfe8139ad5143</originalsourceid><addsrcrecordid>eNpdkk1vEzEQhlcIRD_gwB9AlriUQ4o_dr1rLlUUKESqxKFF4mZN7HHiaNcO9i5S_z1OU6IW-WB75pnXM-OpqneMXgqh6CfkDZVUUfGiOmVUqVktKH355HxSneW8pZQLzuTr6kS0ouW8bk-rX9cJkczXGMw9gWDJFxwxDT74PHwmy0zuNpiQALnFkP2qxwK44h19DCQ6sojDbhphf4We3MYpGdzEaK_eVK8c9BnfPu7n1c_rr3eL77ObH9-Wi_nNzNRSjTPFrDCssQg1w5IW5SAtMsmdahw1nLm2M1iKZKvaKYUWrDUOOyYU2IbV4rxaHnRthK3eJT9AutcRvH4wxLTWkEZvetQrKaUR9cq1ztYSHCjeSAEtF10nOueK1tVBazetBrQGw5igfyb63BP8Rq_jH80oV1IxVhQuHhVS_D1hHvXgs8G-h4Bxypp3gkrZUiEL-uE_dFu6V7q4p7hqVdNwWqjLA7WGUoEPLpaHTVkWB29iKJ9R7PO26fZBrCkBHw8BJsWcE7pj-ozq_bTo47QU9v3Teo_kv_EQfwF5jrjp</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2829795520</pqid></control><display><type>article</type><title>Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?</title><source>Publicly Available Content Database</source><source>DOAJ Directory of Open Access Journals</source><source>PubMed Central</source><creator>Krumm, Marius ; Müller, Markus P</creator><creatorcontrib>Krumm, Marius ; Müller, Markus P</creatorcontrib><description>Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process' behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role.</description><identifier>ISSN: 1099-4300</identifier><identifier>EISSN: 1099-4300</identifier><identifier>DOI: 10.3390/e25060903</identifier><identifier>PMID: 37372247</identifier><language>eng</language><publisher>Switzerland: MDPI AG</publisher><subject>Algorithms ; Analysis ; Compatibility ; computational irreducibility ; Computer science ; Concrete blocks ; Decision making ; Determinism ; Free agency ; Free agents (Sports) ; Free will ; Phenomenology ; Simulation ; simulation preorder ; Turing machines ; universal Turing machines</subject><ispartof>Entropy (Basel, Switzerland), 2023-06, Vol.25 (6), p.903</ispartof><rights>COPYRIGHT 2023 MDPI AG</rights><rights>2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2023 by the authors. 2023</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c469t-91d3c15dea41e37302a6de162f95f0c21f78ce3901b4f99edaddcfe8139ad5143</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2829795520/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2829795520?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,864,885,2100,25752,27923,27924,37011,37012,44589,53790,53792,74897</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/37372247$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Krumm, Marius</creatorcontrib><creatorcontrib>Müller, Markus P</creatorcontrib><title>Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?</title><title>Entropy (Basel, Switzerland)</title><addtitle>Entropy (Basel)</addtitle><description>Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process' behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Compatibility</subject><subject>computational irreducibility</subject><subject>Computer science</subject><subject>Concrete blocks</subject><subject>Decision making</subject><subject>Determinism</subject><subject>Free agency</subject><subject>Free agents (Sports)</subject><subject>Free will</subject><subject>Phenomenology</subject><subject>Simulation</subject><subject>simulation preorder</subject><subject>Turing machines</subject><subject>universal Turing machines</subject><issn>1099-4300</issn><issn>1099-4300</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNpdkk1vEzEQhlcIRD_gwB9AlriUQ4o_dr1rLlUUKESqxKFF4mZN7HHiaNcO9i5S_z1OU6IW-WB75pnXM-OpqneMXgqh6CfkDZVUUfGiOmVUqVktKH355HxSneW8pZQLzuTr6kS0ouW8bk-rX9cJkczXGMw9gWDJFxwxDT74PHwmy0zuNpiQALnFkP2qxwK44h19DCQ6sojDbhphf4We3MYpGdzEaK_eVK8c9BnfPu7n1c_rr3eL77ObH9-Wi_nNzNRSjTPFrDCssQg1w5IW5SAtMsmdahw1nLm2M1iKZKvaKYUWrDUOOyYU2IbV4rxaHnRthK3eJT9AutcRvH4wxLTWkEZvetQrKaUR9cq1ztYSHCjeSAEtF10nOueK1tVBazetBrQGw5igfyb63BP8Rq_jH80oV1IxVhQuHhVS_D1hHvXgs8G-h4Bxypp3gkrZUiEL-uE_dFu6V7q4p7hqVdNwWqjLA7WGUoEPLpaHTVkWB29iKJ9R7PO26fZBrCkBHw8BJsWcE7pj-ozq_bTo47QU9v3Teo_kv_EQfwF5jrjp</recordid><startdate>20230606</startdate><enddate>20230606</enddate><creator>Krumm, Marius</creator><creator>Müller, Markus P</creator><general>MDPI AG</general><general>MDPI</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>HCIFZ</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope></search><sort><creationdate>20230606</creationdate><title>Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?</title><author>Krumm, Marius ; Müller, Markus P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c469t-91d3c15dea41e37302a6de162f95f0c21f78ce3901b4f99edaddcfe8139ad5143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Compatibility</topic><topic>computational irreducibility</topic><topic>Computer science</topic><topic>Concrete blocks</topic><topic>Decision making</topic><topic>Determinism</topic><topic>Free agency</topic><topic>Free agents (Sports)</topic><topic>Free will</topic><topic>Phenomenology</topic><topic>Simulation</topic><topic>simulation preorder</topic><topic>Turing machines</topic><topic>universal Turing machines</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Krumm, Marius</creatorcontrib><creatorcontrib>Müller, Markus P</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>SciTech Premium Collection</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Entropy (Basel, Switzerland)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Krumm, Marius</au><au>Müller, Markus P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood?</atitle><jtitle>Entropy (Basel, Switzerland)</jtitle><addtitle>Entropy (Basel)</addtitle><date>2023-06-06</date><risdate>2023</risdate><volume>25</volume><issue>6</issue><spage>903</spage><pages>903-</pages><issn>1099-4300</issn><eissn>1099-4300</eissn><abstract>Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process' behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role.</abstract><cop>Switzerland</cop><pub>MDPI AG</pub><pmid>37372247</pmid><doi>10.3390/e25060903</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1099-4300 |
ispartof | Entropy (Basel, Switzerland), 2023-06, Vol.25 (6), p.903 |
issn | 1099-4300 1099-4300 |
language | eng |
recordid | cdi_doaj_primary_oai_doaj_org_article_b666c34bf7fd46afa92563a7238838ff |
source | Publicly Available Content Database; DOAJ Directory of Open Access Journals; PubMed Central |
subjects | Algorithms Analysis Compatibility computational irreducibility Computer science Concrete blocks Decision making Determinism Free agency Free agents (Sports) Free will Phenomenology Simulation simulation preorder Turing machines universal Turing machines |
title | Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood? |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T12%3A35%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Free%20Agency%20and%20Determinism:%20Is%20There%20a%20Sensible%20Definition%20of%20Computational%20Sourcehood?&rft.jtitle=Entropy%20(Basel,%20Switzerland)&rft.au=Krumm,%20Marius&rft.date=2023-06-06&rft.volume=25&rft.issue=6&rft.spage=903&rft.pages=903-&rft.issn=1099-4300&rft.eissn=1099-4300&rft_id=info:doi/10.3390/e25060903&rft_dat=%3Cgale_doaj_%3EA758282915%3C/gale_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c469t-91d3c15dea41e37302a6de162f95f0c21f78ce3901b4f99edaddcfe8139ad5143%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2829795520&rft_id=info:pmid/37372247&rft_galeid=A758282915&rfr_iscdi=true |