效应对建构主义的影响

Q3 Computer Science
Liron Cohen, Sofia Abreu Faro, Ross Tate
{"title":"效应对建构主义的影响","authors":"Liron Cohen,&nbsp;Sofia Abreu Faro,&nbsp;Ross Tate","doi":"10.1016/j.entcs.2019.09.006","DOIUrl":null,"url":null,"abstract":"<div><p>It is commonly understood that Countable Choice holds constructively due to the underlying computational nature of constructivism. However, in this paper we demonstrate that invoking different notions of computation result in radically different behaviors regarding Countable Choice. In particular, we illustrate that, although <em>deterministic</em> computation guarantees Countable Choice, <em>non</em>-deterministic computation can negate Countable Choice. We then further show that using <em>stateful</em> computation can restore Countable Choice even in the presence of non-determinism. This finding suggests that much of the modern discourse of constructivism assumes a deterministic underlying computational system, despite non-determinism being a fundamental aspect of modern-day computation.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"347 ","pages":"Pages 87-120"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.006","citationCount":"5","resultStr":"{\"title\":\"The Effects of Effects on Constructivism\",\"authors\":\"Liron Cohen,&nbsp;Sofia Abreu Faro,&nbsp;Ross Tate\",\"doi\":\"10.1016/j.entcs.2019.09.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>It is commonly understood that Countable Choice holds constructively due to the underlying computational nature of constructivism. However, in this paper we demonstrate that invoking different notions of computation result in radically different behaviors regarding Countable Choice. In particular, we illustrate that, although <em>deterministic</em> computation guarantees Countable Choice, <em>non</em>-deterministic computation can negate Countable Choice. We then further show that using <em>stateful</em> computation can restore Countable Choice even in the presence of non-determinism. This finding suggests that much of the modern discourse of constructivism assumes a deterministic underlying computational system, despite non-determinism being a fundamental aspect of modern-day computation.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"347 \",\"pages\":\"Pages 87-120\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.006\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066119301227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066119301227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 5

摘要

人们普遍认为,由于建构主义的潜在计算性质,可数选择具有建设性。然而,在本文中,我们证明了调用不同的计算概念会导致关于可数选择的完全不同的行为。特别是,我们说明,虽然确定性计算保证可数选择,非确定性计算可以否定可数选择。然后我们进一步证明,即使在不确定性存在的情况下,使用状态计算也可以恢复可数选择。这一发现表明,尽管非决定论是现代计算的一个基本方面,但现代建构主义的许多话语都假设了一个确定性的潜在计算系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Effects of Effects on Constructivism

It is commonly understood that Countable Choice holds constructively due to the underlying computational nature of constructivism. However, in this paper we demonstrate that invoking different notions of computation result in radically different behaviors regarding Countable Choice. In particular, we illustrate that, although deterministic computation guarantees Countable Choice, non-deterministic computation can negate Countable Choice. We then further show that using stateful computation can restore Countable Choice even in the presence of non-determinism. This finding suggests that much of the modern discourse of constructivism assumes a deterministic underlying computational system, despite non-determinism being a fundamental aspect of modern-day computation.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)
自引率
0.00%
发文量
0
期刊介绍: ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信