A formalization of multi-tape Turing machines-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A formalization of multi-tape Turing machines

Published:2015-10 Issue: Volume:603 Page:23-42
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Asperti Andrea,Ricciotti Wilmer

Funder

Airbus

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference36 articles.

1. Certified complexity;Amadio;Proc. Comput. Sci.,2011

2. A list-machine benchmark for mechanized metatheory;Appel;J. Automat. Reason.,2012

3. Computational Complexity: A Modern Approach;Arora,2009

4. The intensional content of Rice's theorem;Asperti,2008

5. A formal proof of Borodin–Trakhtenbrot's gap theorem;Asperti,2013

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Imperative Process Algebra and Models of Parallel Computation;Theory of Computing Systems;2024-03-14

2. CONSTRUCTIVE MANY-ONE REDUCTION FROM THE HALTING PROBLEM TO SEMI-UNIFICATION (EXTENDED VERSION);LOG METH COMPUT SCI;2023

3. Program Algebra for Random Access Machine Programs;Scientific Annals of Computer Science;2022-12-07

4. The Undecidability of System F Typability and Type Checking for Reductionists;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

5. Verified programming of Turing machines in Coq;Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs;2020-01-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP