Language:
English
繁體中文
Help
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Computability and complexity = essay...
~
SpringerLink (Online service)
Computability and complexity = essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
Record Type:
Language materials, printed : Monograph/item
Title/Author:
Computability and complexity/ edited by Adam Day ... [et al.].
Reminder of title:
essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
other author:
Day, Adam.
Published:
Cham :Springer International Publishing : : 2017.,
Description:
xlii, 755 p. :ill., digital ; : 24 cm.;
Contained By:
Springer eBooks
Subject:
Computer science - Mathematics. -
Online resource:
https://doi.org/10.1007/978-3-319-50062-1
ISBN:
9783319500621
Computability and complexity = essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
Computability and complexity
essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /[electronic resource] :edited by Adam Day ... [et al.]. - Cham :Springer International Publishing :2017. - xlii, 755 p. :ill., digital ;24 cm. - Lecture notes in computer science,100100302-9743 ;. - Lecture notes in computer science ;6140..
This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer scientist, surfer and Scottish country dancer, on the occasion of his 60th birthday. The Festschrift contains papers and laudations that showcase the broad and important scientific, leadership and mentoring contributions made by Rod during his distinguished career. 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. The volume contains several surveys that make the various areas accessible to non-specialists while also including some proofs that illustrate the flavor of the fields.
ISBN: 9783319500621
Standard No.: 10.1007/978-3-319-50062-1doiSubjects--Topical Terms:
528496
Computer science
--Mathematics.
LC Class. No.: QA76.9.M35
Dewey Class. No.: 004.151
Computability and complexity = essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
LDR
:02011nam a2200337 a 4500
001
939986
003
DE-He213
005
20190620101809.0
006
m d
007
cr nn 008maaau
008
200417s2017 gw s 0 eng d
020
$a
9783319500621
$q
(electronic bk.)
020
$a
9783319500614
$q
(paper)
024
7
$a
10.1007/978-3-319-50062-1
$2
doi
035
$a
978-3-319-50062-1
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.M35
072
7
$a
UMB
$2
bicssc
072
7
$a
COM051300
$2
bisacsh
072
7
$a
UMB
$2
thema
082
0 4
$a
004.151
$2
23
090
$a
QA76.9.M35
$b
C738 2019
245
0 0
$a
Computability and complexity
$h
[electronic resource] :
$b
essays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
$c
edited by Adam Day ... [et al.].
260
$a
Cham :
$c
2017.
$b
Springer International Publishing :
$b
Imprint: Springer,
300
$a
xlii, 755 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
10010
490
1
$a
Theoretical computer science and general issues
520
$a
This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer scientist, surfer and Scottish country dancer, on the occasion of his 60th birthday. The Festschrift contains papers and laudations that showcase the broad and important scientific, leadership and mentoring contributions made by Rod during his distinguished career. 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. The volume contains several surveys that make the various areas accessible to non-specialists while also including some proofs that illustrate the flavor of the fields.
650
0
$a
Computer science
$x
Mathematics.
$3
528496
650
0
$a
Combinatorial analysis.
$3
527896
650
1 4
$a
Algorithm Analysis and Problem Complexity.
$3
593923
650
2 4
$a
Computation by Abstract Devices.
$3
669792
650
2 4
$a
Data Structures.
$3
669824
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
670123
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
670059
650
2 4
$a
Logics and Meanings of Programs.
$3
670058
700
1
$a
Day, Adam.
$3
1226483
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
6140.
$3
744199
830
0
$a
Theoretical computer science and general issues.
$3
1208307
856
4 0
$u
https://doi.org/10.1007/978-3-319-50062-1
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login