非确定性计算和杰恩-罗杰斯定理

Dialogues in cardiovascular medicine : DCM Pub Date : 2014-03-29 DOI:10.4204/EPTCS.143.8

A. Pauly, Matthew de Brecht

{"title":"非确定性计算和杰恩-罗杰斯定理","authors":"A. Pauly, Matthew de Brecht","doi":"10.4204/EPTCS.143.8","DOIUrl":null,"url":null,"abstract":"We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"42 1","pages":"87-96"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Non-deterministic computation and the Jayne-Rogers Theorem\",\"authors\":\"A. Pauly, Matthew de Brecht\",\"doi\":\"10.4204/EPTCS.143.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.\",\"PeriodicalId\":88470,\"journal\":{\"name\":\"Dialogues in cardiovascular medicine : DCM\",\"volume\":\"42 1\",\"pages\":\"87-96\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dialogues in cardiovascular medicine : DCM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.143.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dialogues in cardiovascular medicine : DCM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.143.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

我们从描述集合论中给出了一个简单的证明，证明了Jayne Rogers定理的一个可计算的类比。证明的难度委托给非确定性2型机器的模拟结果。因此，我们证明了计算模型的发展可以在被认为与之相去甚远的领域中得到应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Non-deterministic computation and the Jayne-Rogers Theorem

We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Dialogues in cardiovascular medicine : DCM

自引率

0.00%

发文量