國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Unveiling dynamics and complexity13t...

(1998 :)

Unveiling dynamics and complexity13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Unveiling dynamics and complexityedited by Jarkko Kari, Florin Manea, Ion Petre.
其他題名:	13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings /
其他題名:	CiE 2017
其他作者:	Kari, Jarkko.
團體作者:
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	xiii, 401 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computable functionsCongresses.
電子資源:	https://doi.org/10.1007/978-3-319-58741-7
ISBN:	9783319587417$q(electronic bk.)

Unveiling dynamics and complexity13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings /
Unveiling dynamics and complexity13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings /[electronic resource] :CiE 2017edited by Jarkko Kari, Florin Manea, Ion Petre. - Cham :Springer International Publishing :2017. - xiii, 401 p. :ill., digital ;24 cm. - Lecture notes in computer science,103070302-9743 ;. - Lecture notes in computer science ;4891..

Algorithmics for biology -- Combinatorics and algorithmics on words -- Computability in analysis, algebra, and geometry -- Cryptography and information theory -- Formal languages and automata theory -- History and philosophy of computing.

This book constitutes the refereed proceedings of the 13th Conference on Computability in Europe, CiE 2017, held in Turku, Finland, in June 2017. The 24 revised full papers and 12 invited papers were carefully reviewed and selected from 69 submissions. The conference CiE 2016 has six special sessions, namly: algorithmics for biology; combinatorics and algorithmics on words; computability in analysis, algebra, and geometry; cryptography and information theory; formal languages and automata theory; and history and philosophy of computing.

ISBN: 9783319587417$q(electronic bk.)

Standard No.: 10.1007/978-3-319-58741-7doiSubjects--Topical Terms:

437625
Computable functions
--Congresses.

LC Class. No.: QA9.59 / .C66 2017

Dewey Class. No.: 511.352

Unveiling dynamics and complexity13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings /
LDR:02015nmm a2200361 a 4500 001 558397
003 DE-He213
005 20190619105412.0
006 m d
007 cr nn 008maaau
008 191212s2017 gw s 0 eng d
020 $a 9783319587417$q(electronic bk.)
020 $a 9783319587400$q(paper)
024 7 $a 10.1007/978-3-319-58741-7 $2 doi
035 $a 978-3-319-58741-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.59 $b .C66 2017
072 7 $a UYZG $2 bicssc
072 7 $a COM037000 $2 bisacsh
072 7 $a UYZG $2 thema
082 0 4 $a 511.352 $2 23
090 $a QA9.59 $b .C748 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Unveiling dynamics and complexity $h [electronic resource] : $b 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017 : proceedings / $c edited by Jarkko Kari, Florin Manea, Ion Petre.
246 3 $a CiE 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xiii, 401 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10307
490 1 $a Theoretical computer science and general issues
505 0 $a Algorithmics for biology -- Combinatorics and algorithmics on words -- Computability in analysis, algebra, and geometry -- Cryptography and information theory -- Formal languages and automata theory -- History and philosophy of computing.
520 $a This book constitutes the refereed proceedings of the 13th Conference on Computability in Europe, CiE 2017, held in Turku, Finland, in June 2017. The 24 revised full papers and 12 invited papers were carefully reviewed and selected from 69 submissions. The conference CiE 2016 has six special sessions, namly: algorithmics for biology; combinatorics and algorithmics on words; computability in analysis, algebra, and geometry; cryptography and information theory; formal languages and automata theory; and history and philosophy of computing.
650 0 $a Computable functions $v Congresses. $3 437625
650 0 $a Algorithms $3 253943
650 0 $a Information theory $3 253413
650 0 $a Computer science $3 252805
650 0 $a Biology $x Computer simulation $v Congresses. $3 436447
650 0 $a Computer science. $3 199325
650 0 $a Computers. $3 202174
650 0 $a Algorithms. $3 184661
650 0 $a Logic, Symbolic and mathematical. $3 180452
650 0 $a Computer science $x Mathematics. $3 181991
650 0 $a Artificial intelligence. $3 194058
650 0 $a Pattern perception. $3 182522
650 1 4 $a Computation by Abstract Devices. $3 273703
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
700 1 $a Kari, Jarkko. $3 726477
700 1 $a Manea, Florin. $3 729091
700 1 $a Petre, Ion. $3 379544
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-58741-7
950 $a Computer Science (Springer-11645)