C.A.D.I.L.L.A.C.
  • Home
  • C.A.D.I.L.L.A.C. News Blog
  • C.A.D.I.L.L.A.C. Events
    • 2016 Cognitive, linguistic and logical aspects of perspective-taking
    • 2016 Autism Research Network Meeting
    • 2015 Stig Andur Pedersen's retirement symposium
    • 2015 Cognitive, linguistic and logical aspects of perspective-taking 2015
    • 2014 Arthur Prior
    • 2014 Workshop on Planning, Logic and Social Intelligence
    • 2014 Mathematical Reflections
    • Modality and Modalities, M&M 2012- 2014
  • Contact us
  • Links and Resources

Welcome to our News Blog

Keep up-to-date with news, announcements and events in the area and abroad. Feel free to contact us if you have something you'd like us to share.

contact us

15/1-16 @ DTU: Two talks on algorithmic and logical aspects of cognition

8/1/2016

 
Friday 15 January DTU Compute will host two talks on algorithmic and logical aspects of cognition, followed by beer and snacks...

Time and place: Room S10, DTU meeting centre, building 101, 13.00-15.15 + drinks afterwards.
Host: Thomas Bolander

Schedule:

13.00-14.00 Iris van de Pol, PhD student, ILLC, University of Amsterdam. Complexity of Theory of Mind.
14.15-15.15 Jakub Szymanik, associate professor, ILLC, University of Amsterdam. Complexity of turn-based games.

Abstracts

Iris van de Pol. Complexity of Theory of Mind

In this talk I will discuss the complexity of theory of mind, which is the cognitive phenomenon that people attribute mental states to each other, like beliefs, desires, and intentions, and use these to predict or explain each other’s behavior. I present a computational-level model of theory of mind—based on dynamic epistemic logic—and analyze its (parameterized) complexity. In particular I show that the model is PSPACE-complete and that the modal depth of a formula does not influence its complexity. 
This talk is based on my master’s thesis. For a pdf, see: http://goo.gl/21FG2G.

--

Jakub Szymanik. Complexity of turn-based games

Inspired by the logical analysis of backward induction and cognitive science experiments, we investigate the computational complexity of the reasoning in extensive form dynamic games. We formalize the computational complexity of a general decision problem the players face, assuming common knowledge of rationality. We show that such defined problem is PTIME-complete.  Moreover, we provide a more refined analysis of the complexity of particular game trials which takes into account alternation type of the game and pay-off distribution. We conclude with some mathematical and cognitive open problems.

--

Please sign up for the talk at latest on 13 January, so I know how much beer and snacks to buy.

All are welcome! (Please distribute this email to any others you think might be interested). 
 
Best regards,

     Thomas Bolander

Comments are closed.

    Archives

    May 2016
    February 2016
    January 2016
    September 2015
    June 2015
    April 2015
    February 2015
    December 2014
    May 2014
    April 2014
    March 2014
    December 2013
    October 2013
    September 2013
    May 2013
    April 2013
    August 2012
    June 2012
    May 2012
    April 2012
    February 2012
    October 2011

    Categories

    All
    Adrianne Rini
    Carlo Proietti
    Emmanuel Genot
    Guillaume Aucher
    Hans Van Ditmarsch
    Hanti Lin
    Jens Ulrik Hansen
    Justine Jacot
    Kevin T. Kelly
    Klaus Frovin Jørgensen
    Luciana Benotti
    Martin Mose Bentzen
    Max Cresswell
    Mikkel Gerken
    Olivier Roy
    Patrick Blackburn
    Pelle Guldborg Hansen
    Peter Øhrstrøm
    Rasmus K. Rendsvig
    Sebastian Enqvist
    Thomas Bolander
    Torben Braüner
    Valentin Goranko

    RSS Feed

Powered by Create your own unique website with customizable templates.