会议信息

MCU 2018: Conference on Machines, Computations and Universality

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
登录 注册
嵌入截止倒计时徽章
MCU
截稿日期:
2018-02-19 Extended
通知日期:
2018-03-27
会议日期:
2018-06-28
会议地点:
Fontainebleau, France
届数:
8
ICORE: C   浏览: 12260   关注: 0   参加: 0

征稿

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 最后更新于

相关会议

CCFICORE简称全称截稿日期通知日期会议日期
AA*SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-04-022026-07-20
AA*AAAIAAAI Conference on Artificial Intelligence2026-07-212026-11-302027-02-16
AA*CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-02-202026-06-03
BA*ICRAInternational Conference on Robotics and Automation2027-05-24
BA*IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
AA*STOCACM Symposium on Theory of Computing2025-11-042026-02-012026-06-22
CICCInternational Conference on Communications2026-10-022027-01-152027-05-30
CBIJCNNInternational Joint Conference on Neural Networks2027-01-312027-03-152027-06-14
BICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-01-132027-05-16
BA*PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-03-012027-06-13

相关期刊

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 Systems6.1Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655

评论 0

暂无评论。

请登录后发表评论