CiE 2016 - 2016 Computability in Europe

CiE 2016 conference topics include, but not limited to:
Admissible setsAlgorithmsAnalog computationArtificial intelligenceAutomata theoryBioinformatics and bio-inspired computationBounded arithmeticClassical computability and degree structuresCognitive science and modellingComplexity classesComputability theoretic aspects of programsComputable analysis and real computationComputable structures and modelsComputational and proof complexityComputational biologyComputational creativityComputational learning and complexityComputational linguisticsConcurrency and distributed computationConstructive mathematicsCryptographic complexityDecidability of theoriesDerandomizationDNA computingDomain theory and computabilityDynamical systems and computational modelsEffective descriptive set theoryEmerging and non-standard models of computationFinite model theoryFormal aspects of program analysisFormal methodsFoundations of computer scienceGamesGeneralized recursion theory
History of computation
Hybrid systems
Higher type computability
Hypercomputational models
Infinite time Turing machines
Kolmogorov complexity
Lambda and combinatory calculi
L-systems and membrane computation
Machine learning
Mathematical models of emergence
Molecular computation
Morphogenesis and developmental biology
Multi-agent systems
Natural computation
Neural nets and connectionist models
Philosophy of science and computation
Physics and computability
Probabilistic systems
Process algebras and concurrent systems
Programming language semantics
Proof mining and applications
Proof theory and computability
Proof complexity
Quantum computing and complexity
Randomness
Reducibilities and relative computation
Relativistic computation
Reverse mathematics
Semantics and logic of computation
Swarm intelligence and self-organisation
Type systems and type theory
Uncertain reasoning
Weak systems of arithmetic and applications