Models of Computation in Context [electronic resource] : 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011, Proceedings / edited by Benedikt Löwe, Dag Normann, Ivan Soskov, Alexandra Soskova.
Contributor(s): Löwe, Benedikt [editor.]
| Normann, Dag [editor.] | Soskov, Ivan [editor.] | Soskova, Alexandra [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6735Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XIII, 319 p. 27 illus., 11 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642218750.Subject(s): Computer science | Algorithms | Computer science -- Mathematics | Discrete mathematics | Mathematical logic | Theory of Computation | Algorithms | Discrete Mathematics in Computer Science | Symbolic and Algebraic Manipulation | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011.The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%. The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.
No physical items for this record
This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011.The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%. The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.
There are no comments for this item.