Información de la conferencia
MCU 2018: Conference on Machines, Computations and Universality
https://mcu2018.lacl.fr/
Día de Entrega:
2018-02-19 Extended
Fecha de Notificación:
2018-03-27
Fecha de Conferencia:
2018-06-28
Ubicación:
Fontainebleau, France
Años:
8
Vistas: 6906   Seguidores: 0   Asistentes: 0

Solicitud de Artículos
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.
Última Actualización Por Dou Sun en 2018-02-05
Conferencias Relacionadas
CCFCOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónConferencia
CCSBInternational Conference on Computer Science and Blockchain2023-07-31 2023-11-17
ICT&KEInternational Conference on ICT and Knowledge Engineering2012-08-152012-09-152012-11-21
b1TLCAInternational Conference on Typed Lambda Calculi and Applications2015-01-302015-04-022015-06-29
2MAEInternational Conference on Mechanical, Material and Aerospace Engineering2018-03-152018-04-052018-05-10
aaa1CSCWACM Conference on Computer-Supported Cooperative Work and Social Computing2025-07-012205-08-062025-10-18
ICRAICInternational Conference on Robotics Automation and Intelligent Control2024-09-302024-11-122024-12-06
EuroPLoPEuropean Conference on Pattern Languages of Programs2019-02-202019-05-152019-07-03
ca1PSBPacific Symposium on Biocomputing2016-08-012016-09-122017-01-03
Revistas Relacionadas
CCFNombre CompletoFactor de ImpactoEditorISSN
bParallel Computing2.000Elsevier0167-8191
bAlgorithmica0.900Springer0178-4617
Microelectronics Reliability1.600Elsevier0026-2714
International Journal on Web Service Computing AIRCC2230-7702
Journal of Network and Systems Management4.100Springer1064-7570
bComputer Vision and Image Understanding4.300Elsevier1077-3142
International Journal of E-Entrepreneurship and Innovation IGI Global1947-8585
bIEEE Transaction on Wireless Communications8.900IEEE1536-1276
Journal of Computational Physics3.800Elsevier0021-9991
Science, Technology, & Human Values3.100SAGE0162-2439
Recomendaciones