Conference Information

MCU 2018: Conference on Machines, Computations and Universality

Please Login to view website of conference

Submission Date:
2018-02-19 Extended
Notification Date:
2018-03-27
Conference Date:
2018-06-28
Location:
Fontainebleau, France
Years:
8
Viewed: 11841   Tracked: 0   Attend: 0

Call For Papers

MCU 2018 (Conference on Machines, Computations and Universality) is an academic 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.
Last updated by Dou Sun in

Related Conferences

CCFCOREQUALISShortFull NameSubmissionNotificationConference
aa*a1AAAIAAAI Conference on Artificial Intelligence2025-07-252025-11-032026-01-20
aa*a1SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-04-022026-07-20
aa*a1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-02-202026-06-03
bba1ICRAInternational Conference on Robotics and Automation2025-09-152026-06-01
aa*a1IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
aa*a1STOCACM Symposium on Theory of Computing2025-11-042026-02-012026-06-22
cba2ICCInternational Conference on Communications2025-10-132026-01-122026-05-24
caa2IJCNNInternational Joint Conference on Neural Networks2025-01-152025-03-312025-06-30
bba1ICASSPInternational Conference on Acoustics, Speech and Signal Processing2025-09-172026-01-162026-05-04
ba*a1PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-03-012027-06-13

Related Journals

CCFFull NameImpact FactorPublisherISSN
Engineering Computations1.9Emerald0264-4401
MachinesMDPI2075-1702
Minds and Machines3.4Springer0924-6495
bIEEE 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

Tracker
No results found.
AttenderYear
No results found.
Advertisment