Notepad
The notepad is empty.
The basket is empty.
Free shipping possible
Please wait - the print view of the page is being prepared.
The print dialogue opens as soon as the page has been completely loaded.
If the print preview is incomplete, please close it and select "Print again".

Computability and Complexity

Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
BookPaperback
Ranking2510in
CHF135.00

Description

The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence.
More descriptions

Details

ISBN/GTIN978-3-319-50061-4
Product TypeBook
BindingPaperback
PublisherSpringer
Publishing date06/12/2016
SeriesLecture Notes in Computer Science
Series no.10010
Pages755 pages
LanguageEnglish
SizeWidth 155 mm, Height 235 mm
Weight11869 g
IllustrationsXLII, 755 p. 22 illus., schwarz-weiss Illustrationen
Article no.4724245
CatalogsBuchzentrum
Data source no.22160367
More details

Series

Author

Subjects

BZ
Abstract ~ Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Algorithms
Algorithms & data structures
Analysis ~ Algorithm Analysis and Problem Complexity
B
Complexity ~ Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Computation ~ Theory of Computation
Computer architecture & logic design
Computer logic
Computer programming / software engineering
Computer science (Data structures)
Computer science-Mathematics
Computer ~ Discrete Mathematics in Computer Science
Computers
Data Structures
Data Structures and Information Theory
Data structures (Computer science)
Devices ~ Computation by Abstract Devices
Discrete Mathematics
Discrete Mathematics in Computer Science
Formal ~ Mathematical Logic and Formal Languages
Foundations ~ Mathematical Logic and Foundations
Information ~ Data Structures and Information Theory
Languages ~ Mathematical Logic and Formal Languages
Logic ~ Mathematical Logic and Formal Languages
Logic ~ Mathematical Logic and Foundations
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Mathematical logic
Mathematical theory of computation
Mathematics ~ Computer science-Mathematics
Mathematics ~ Discrete Mathematics
Mathematics ~ Discrete Mathematics in Computer Science
Maths for computer scientists
Meanings ~ Logics and Meanings of Programs
Problem ~ Algorithm Analysis and Problem Complexity
Programs ~ Logics and Meanings of Programs
Science ~ Discrete Mathematics in Computer Science
Structures ~ Data Structures
Structures ~ Data Structures and Information Theory
Theory of Computation
Theory ~ Data Structures and Information Theory
and ~ Algorithm Analysis and Problem Complexity
and ~ Data Structures and Information Theory
and ~ Logics and Meanings of Programs
and ~ Mathematical Logic and Formal Languages
and ~ Mathematical Logic and Foundations
architecture ~ Computer architecture & logic design
computation ~ Mathematical theory of computation
computer science
computer ~ Maths for computer scientists
data ~ Algorithms & data structures
design ~ Computer architecture & logic design
engineering ~ Computer programming / software engineering
for ~ Maths for computer scientists
logic ~ Computer architecture & logic design
logic ~ Computer logic
logic ~ Mathematical logic
programming ~ Computer programming / software engineering
science ~ Computer science-Mathematics
science ~ Data structures (Computer science)
science ~ computer science
scientists ~ Maths for computer scientists
software ~ Computer programming / software engineering
structures ~ Algorithms & data structures
structures ~ Data structures (Computer science)
theory ~ Mathematical theory of computation
VLB main reading rationale