<div dir="ltr"><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px">Mustafa Hocam,</span></div><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px">"conference topics includes, but is not limited to" ifadesini içeren toplantı ilanlarını eleyen bir süzgeç yapmak mümkün müdür? </span><br></div><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif"><span style="font-family:'Times New Roman',serif;font-size:13.3333330154419px">hürmetler</span></div><div class="gmail_extra"><br clear="all"><div><div class="gmail_signature">--<br>A. M. Uludag<br><a href="http://math.gsu.edu.tr/uludag/">http://math.gsu.edu.tr/uludag/</a></div></div>
<br><div class="gmail_quote">On Mon, Mar 16, 2015 at 4:44 PM, Rza Bashirov <span dir="ltr"><<a href="mailto:rza.bashirov@emu.edu.tr" target="_blank">rza.bashirov@emu.edu.tr</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div lang="EN-US" link="blue" vlink="purple"><div><p><span style="font-size:10.0pt">Dear Colleague<span style="color:#1f497d">s</span>,<br><br>Due to several requests the deadline for submissions to MCU'15 is extended,<br>please find the final call for papers below.<br><br>************************************************************************<br>7th International conference Machines, Computations and Universality (MCU’15)<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">Famagusta, North-Cyprus, 9-11 September 2015<br><br>FINAL CALL FOR PAPERS - EXTENDED DEADLINE FOR SUBMISSIONS: 26 March 2015<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">The International conference MCU series traces its roots back to the<span style="color:#1f497d"> </span>mid 90's, and has always been concerned with gaining a deeper<br>understanding of computation and universality through the study of<span style="color:#1f497d"> </span>models of general purpose computation.<span style="color:#1f497d"> </span>The MCU conference series was initiated in Paris in 1995. Following<span style="color:#1f497d"> </span>editions were held in Metz in 1998, in Chisinau in 2001, in<span style="color:#1f497d"> </span>St. Petersburg in 2004, in Orleans in 2007, and in Zurich in 2013.<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">SCOPE<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">The scope of the conference topics includes, but is not limited to,<span style="color:#1f497d"> </span>computation in the setting of various discrete models (Turing<br>machines, register machines, cellular automata, tile assembly systems,<span style="color:#1f497d"> </span>rewriting systems, molecular computing models, neural models...) and<br>analog and hybrid models (BSS machines, infinite time cellular<span style="color:#1f497d"> </span>automata, real machines, quantum computing...) and the meaning and<br>implantation of universality in these contexts. Particular emphasis is<span style="color:#1f497d"> </span>given towards search for frontiers between decidability and<br>undecidability in the various models, search for the simplest<span style="color:#1f497d"> </span>universal models, computational complexity of predicting the evolution<br>of computations in the various models... Parallel computing models<span style="color:#1f497d"> </span>and their connections to decidability, complexity and universality.<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">TOPICS ADDRESSED<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">MCU 2015 conference topics include, but not exclusively:<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">* Analog computation<br>* Automata theory<br>* Cellular automata<br>* Classical computability and degree structures<br>* Computability theoretic aspects of programs<br>* Computable analysis and real computation<br>* Computable structures and models<br>* Continuous computing<br>* Decidability of theories<br>* DNA computing, self-assembly and tiling<br>* Dynamical systems and computational models<br>* Emerging and non-standard models of computation<br>* Finite model theory<br>* Generalized recursion theory<br>* Higher type computability<br>* Hypercomputational models<br>* Infinite time Turing machines<br>* Membrane computing<br>* Molecular computation<br>* Morphogenesis and developmental biology<br>* Multi-agent systems<br>* Natural computation and Hybrid systems<br>* Neural nets and connectionist models<br>* Physics and computability<br>* Proof theory and computability<br>* Randomness and Kolmogorov complexity<br>* Relativistic computation<br>* Swarm intelligence and self-organisation<br>* Theory of Petri nets<br>* Turing, Counter, Register, Signal machines<br>* Universality of systems<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">We particularly welcome submissions in emergent areas, such as<br>parallel models of computing, bioinformatics and unconventional<br>computation...<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">IMPORTANT DATES<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">Submission Deadline: 26 March 2015<br>Notification of authors: 27 May 2015<br>Deadline for final version: 20 June 2015<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">SUBMISSIONS<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">Authors of accepted papers are expected to present their work at the<span style="color:#1f497d"> </span>conference. Submitted papers must describe work not previously<br>published, and they must neither be accepted nor under review at a<span style="color:#1f497d"> </span>journal or at another conference with refereed proceedings.<br>Authors are required to submit their manuscripts electronically in PDF<span style="color:#1f497d"> </span>using the LNCS style. Authors using LaTeX can download the needed macros<span style="color:#1f497d"> </span>at Springer-Verlag site. Papers should not exceed 15 pages; full proofs<span style="color:#1f497d"> </span>may appear in a clearly marked technical appendix which will be read at<span style="color:#1f497d"> </span>the reviewers' discretion.<span style="color:#1f497d"> </span>The submission process is managed by EasyChair.<span style="color:#1f497d"> <u></u><u></u></span></span></p><p><span style="font-size:10.0pt"><a href="https://easychair.org/conferences/?conf=mcu2015" target="_blank">https://easychair.org/conferences/?conf=mcu2015</a><span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">The proceedings will be available at the conference venue. It will be an<span style="color:#1f497d"> </span>LNCS volume by Springer Verlag.<br>There will be a best paper and a best student paper award.<span style="color:#1f497d"><u></u><u></u></span></span></p><p><span style="font-size:10.0pt">INVITED SPEAKERS<br><br>* Matthew Cook (University of Zürich and ETH Zürich, Switzerland)<br>* Jetty Kleijn (Leiden University, The Netherlands)<br>* Linqiang Pan (Huazhong University of Science and Technology, China)<br>* Anne Siegel (IRISA/CNRS, Dyliss, France)<br>* Mike Stannett (University of Sheffield, UK)<br><br>PROGRAM COMMITTEE<br><br>* Andrew Adamatzky, University of the West of England, UK<br>* Rza Bashirov, Eastern Mediterranean University, Famagusta<br>* Laurent Bienvenu, CNRS, Université Paris Diderot<br>* Erzsébet Csuhaj-Varjú, Eötvös Loránd University, Hungary<br>* Jérôme Durand-Lose, University of Orléans, France (co-chair)<br>* Henning Fernau, University of Trier, Germany<br>* Rudolf Freund, University of Vienna, Austria<br>* Gabriel Istrate, West University of Timisoara, Romania<br>* Jarkko Kari, University of Turku, Finland<br>* Martin Kutrib, Universität Gießen, Germany<br>* Peter Leupold, University of Leipzig, Germany<br>* Maurice Margenstern, University of Lorraine, France<br>* Kenichi Morita, Hiroshima University, Japan<br>* Benedek Nagy, Eastern Mediterranean University, Famagusta and<br> University of Debrecen, Hungary (co-chair)<br>* Turlough Neary, University of Zürich and ETH Zürich<br>* Matthew Patitz, University of Arkansas, USA<br>* Gheorghe Paun, Romanian Academy, Bucharest, Romania<br>* Igor Potapov, University of Liverpool, UK<br>* Kumbakonam Govindarajan Subramanian, University of Science, Malaysia<br>* Klaus Sutner, University Carnegy-Mellon, USA<br>* György Vaszil, University of Debrecen, Hungary<br>* Sergey Verlan, University of Paris Est, France<br><br><br>Contact: Benedek Nagy - mcu2015 (at) <a href="http://emu.edu.tr" target="_blank">emu.edu.tr</a><br> Jérôme Durand-Lose - jerome.durand-lose (at) <a href="http://univ-orleans.fr" target="_blank">univ-orleans.fr</a><br>Website: <a href="http://mcu2015.emu.edu.tr" target="_blank">http://mcu2015.emu.edu.tr</a><br>************************************************************************</span><u></u><u></u></p></div></div><br>_______________________________________________<br>
Turkmath mailing list<br>
<a href="mailto:Turkmath@listweb.bilkent.edu.tr">Turkmath@listweb.bilkent.edu.tr</a><br>
<a href="http://yunus.listweb.bilkent.edu.tr/cgi-bin/mailman/listinfo/turkmath" target="_blank">http://yunus.listweb.bilkent.edu.tr/cgi-bin/mailman/listinfo/turkmath</a><br>
<br></blockquote></div><br></div></div>