会议信息

MCU 2018: Conference on Machines, Computations and Universality

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
MCU
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2018-02-19 Extended
通知日期:
2018-03-27
会议日期:
2018-06-28
会议地点:
Fontainebleau, France
届数:
8
ICORE: C   浏览: 12953   关注: 0   参加: 0

会伴指数 (CP-I)

46.7 / 100
全站第 2,347 名 / 共 5,682 个会议 · 前 42%
学术认可 (35%)
58
投稿选择性 (20%) 无数据 —— 按中性基准 50 分计入 —
会议传承 (20%)
59
社区关注 (10%)
8
资料公开度 (15%)
25

用到的输入: 收录等级：ICORE C · 有据可查的届次：8 · 过去 24 个月打开过本页的研究者：2 人

公开资料里还缺: 历年录用率 (+4.5) · 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 80% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-20

征稿

MCU 2018 (Conference on Machines, Computations and Universality) is a ICORE C conference held in Fontainebleau, France on 2018-06-28. The paper submission deadline is 2018-02-19 (extended). Acceptance notifications are sent on 2018-03-27.

Aim and Scope The MCU traces its roots back to mid of 90s, and has since been concerned with gaining a deeper understanding of computation through the study of models of general purpose computation. MCU explores computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models etc.) and analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing etc.). The 8th MCU will be hosted by the University of Paris Est Creteil Val de Marne and it will take place at IUT de Fontainebleau, located in the city of Fontainebleau, former residence of French kings situated near Paris. The conference will be collocated with the conference UCNC 2018. Topics of Interest There is particular (but not exclusive) emphasis given towards the following: The search for frontiers between decidability and undecidability in the various models. (For example, what is the smallest number of pairs of words for which the Post correspondence problem is undecidable, or what is the largest state-symbol product for which the halting problem is decidable for Turing machines?) The search for the simplest universal models (such as small universal Turing machines, universal rewriting systems with few rules, universal cellular automata with small neighborhoods and a small number of states, etc.) The computational complexity of predicting the evolution of computations in the various models. (For example, is it possible to predict an arbitrary number of time steps for a model more efficiently than explicit step by step simulation of the model?) How parallelism can be connected to decidability, complexity and universality. Universality and undecidability in continuous models of computation.
由 Dou Sun 最后更新于

相关会议

相关期刊

CCF全称影响因子出版商ISSN
Engineering Computations1.9Emerald0264-4401
MachinesMDPI2075-1702
Minds and Machines3.4Springer0924-6495
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655

评论 0

暂无评论。

请登录后发表评论