000 03817nam a22006495i 4500
001 978-3-642-38164-5
003 DE-He213
005 20200420220214.0
007 cr nn 008mamaa
008 130427s2013 gw | s |||| 0|eng d
020 _a9783642381645
_9978-3-642-38164-5
024 7 _a10.1007/978-3-642-38164-5
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aComputation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky
_h[electronic resource] :
_bEssays Dedicated to Samson Abramsky on the Occasion of His 60th Birthday /
_cedited by Bob Coecke, Luke Ong, Prakash Panangaden.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXX, 365 p. 26 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7860
505 0 _aUse of a Canonical Hidden-Variable Space in Quantum Mechanics -- Imperfect Information in Logic and Concurrent Games -- Compositional Quantum Logic -- The Algebra of Directed Acyclic Graphs -- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits -- Payoffs, Intensionality and Abstraction in Games -- On the Theory of Composition in Physics -- On the Functor 2 -- Quantum Speedup and Categorical Distributivity -- Unifying Semantics for Concurrent Programming -- Unfixing the Fixpoint: The Theories of the (Sn(BY -Calculus -- Continuous Domain Theory in Logical Form -- Presheaf Models of Quantum Computation: An Outline -- Nothing Can Be Fixed -- Dialogue Categories and Frobenius Monoids -- Anatomy of a Domain of Continuous Random Variables II -- Towards Nominal Abramsky -- Techniques for Formal Modelling and Analysis of Quantum Systems -- Quantum Field Theory for Legspinners -- Bicompletions of Distance Matrices -- Partial Recursive Functions and Finality -- Breaking the Atom with Samson -- Reasoning about Strategies -- Domain Theory in Topical Form -- Kolmogorov Complexity of Categories.
520 _aThis Festschrift volume, published in honor of Samson Abramsky, contains contributions written by some of his colleagues, former students, and friends. In celebration of the 60th birthday of Samson Abramsky, a conference was held in Oxford, UK, during May 28-30, 2010. The papers in this volume represent his manifold contributions to semantics, logic, games, and quantum mechanics.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aCoecke, Bob.
_eeditor.
700 1 _aOng, Luke.
_eeditor.
700 1 _aPanangaden, Prakash.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642381638
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7860
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-38164-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c51463
_d51463