Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Computability and complexityessays d...
~
Day, Adam.
Computability and complexityessays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
Record Type:
Electronic resources : Monograph/item
Title/Author:
Computability and complexityedited 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 scienceMathematics.
Online resource:
https://doi.org/10.1007/978-3-319-50062-1
ISBN:
9783319500621$q(electronic bk.)
Computability and complexityessays 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 ;4891..
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$q(electronic bk.)
Standard No.: 10.1007/978-3-319-50062-1doiSubjects--Topical Terms:
181991
Computer science
--Mathematics.
LC Class. No.: QA76.9.M35
Dewey Class. No.: 004.151
Computability and complexityessays dedicated to Rodney G. Downey on the occasion of his 60th Birthday /
LDR
:02011nmm a2200337 a 4500
001
558297
003
DE-He213
005
20190620101809.0
006
m d
007
cr nn 008maaau
008
191212s2017 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 :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2017.
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
181991
650
0
$a
Combinatorial analysis.
$3
182280
650
1 4
$a
Algorithm Analysis and Problem Complexity.
$3
273702
650
2 4
$a
Computation by Abstract Devices.
$3
273703
650
2 4
$a
Data Structures.
$3
273992
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
274791
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
275383
650
2 4
$a
Logics and Meanings of Programs.
$3
275357
700
1
$a
Day, Adam.
$3
840999
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
4891.
$3
383229
830
0
$a
Theoretical computer science and general issues.
$3
822018
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)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000170429
電子館藏
1圖書
電子書
EB QA76.9.M35 C738 2019 2017
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
https://doi.org/10.1007/978-3-319-50062-1
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login