Normal view MARC view ISBD view

Methods and Applications of Algorithmic Complexity (Record no. 200457507)

MARC details
000 -LEADER
fixed length control field	04861nam a22006015i 4500
003 - CONTROL NUMBER IDENTIFIER
control field	TR-AnTOB
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20231121134602.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field	cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	220516s2022 gw \| s \|\|\|\| 0\|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	9783662649855
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code	10.1007/978-3-662-64985-5
Source of number or code	doi
040 ## - CATALOGING SOURCE
Original cataloging agency	TR-AnTOB
Language of cataloging	eng
Description conventions	rda
Transcribing agency	TR-AnTOB
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title	İngilizce
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number	QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code	TBJ
Source	bicssc

Subject category code	GPFC
Source	bicssc

Subject category code	TEC009000
Source	bisacsh

Subject category code	TBJ
Source	thema

Subject category code	GPFC
Source	thema
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR)	QA76.9.A43EBK
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name	Zenil, Hector.
Relator term	author.
Relator code	aut
--	http://id.loc.gov/vocabulary/relators/aut
245 10 - TITLE STATEMENT
Title	Methods and Applications of Algorithmic Complexity
Medium	[electronic resource] :
Remainder of title	Beyond Statistical Lossless Compression /
Statement of responsibility, etc.	by Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
250 ## - EDITION STATEMENT
Edition statement	1st ed. 2022.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture	Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer	Springer Berlin Heidelberg :
--	Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice	2022.
300 ## - PHYSICAL DESCRIPTION
Extent	1 online resource
336 ## - CONTENT TYPE
Content type term	text
Content type code	txt
Source	rdacontent
337 ## - MEDIA TYPE
Media type term	computer
Media type code	c
Source	rdamedia
338 ## - CARRIER TYPE
Carrier type term	online resource
Carrier type code	cr
Source	rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type	text file
Encoding format	PDF
Source	rda
490 1# - SERIES STATEMENT
Series statement	Emergence, Complexity and Computation,
International Standard Serial Number	2194-7295 ;
Volume/sequential designation	44
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note	Preliminaries -- Enumerating and simulating Turing machines -- The Coding Theorem Method -- Theoretical aspects of ﬁnite approximations to Levin’s semi-measure.
520 ## - SUMMARY, ETC.
Summary, etc.	This book explores a different pragmatic approach to algorithmic complexity rooted or motivated by the theoretical foundations of algorithmic probability and explores the relaxation of necessary and sufficient conditions in the pursuit of numerical applicability, with some of these approaches entailing greater risks than others in exchange for greater relevance and applicability. Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently coexist for the first time, ranging from the dominant ones based upon popular statistical lossless compression algorithms (such as LZW) to newer approaches that advance, complement, and also pose their own limitations. Evidence suggesting that these different methods complement each other for different regimes is presented, and despite their many challenges, some of these methods are better grounded in or motivated by the principles of algorithmic information. The authors propose that the field can make greater contributions to science, causation, scientific discovery, networks, and cognition, to mention a few among many fields, instead of remaining either as a technical curiosity of mathematical interest only or as a statistical tool when collapsed into an application of popular lossless compression algorithms. This book goes, thus, beyond popular statistical lossless compression and introduces a different methodological approach to dealing with algorithmic complexity. For example, graph theory and network science are classic subjects in mathematics widely investigated in the twentieth century, transforming research in many fields of science from economy to medicine. However, it has become increasingly clear that the challenge of analyzing these networks cannot be addressed by tools relying solely on statistical methods. Therefore, model-driven approaches are needed. Recent advances in network science suggest that algorithmic information theory could play an increasingly important role in breaking those limits imposed by traditional statistical analysis (entropy or statistical compression) in modeling evolving complex networks or interacting networks. Further progress on this front calls for new techniques for an improved mechanistic understanding of complex systems, thereby calling out for increased interaction between systems science, network theory, and algorithmic information theory, to which this book contributes.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element	Dynamics.

Topical term or geographic name entry element	Nonlinear theories.

Topical term or geographic name entry element	Computational intelligence.

Topical term or geographic name entry element	Artificial intelligence.

Topical term or geographic name entry element	Applied Dynamical Systems.

Topical term or geographic name entry element	Computational Intelligence.

Topical term or geographic name entry element	Artificial Intelligence.
653 #0 - INDEX TERM--UNCONTROLLED
Uncontrolled term	Computer algorithms

Uncontrolled term	Computational complexity

Uncontrolled term	Data compression (Computer science)
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name	Toscano, Fernando Soler.
Relator term	author.
Relator code	aut
--	http://id.loc.gov/vocabulary/relators/aut

Personal name	Gauvrit, Nicolas.
Relator term	author.
Relator code	aut
--	http://id.loc.gov/vocabulary/relators/aut
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element	SpringerLink (Online service)
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title	Emergence, Complexity and Computation,
International Standard Serial Number	2194-7295 ;
Volume/sequential designation	44
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier	<a href="https://doi.org/10.1007/978-3-662-64985-5">https://doi.org/10.1007/978-3-662-64985-5</a>
Materials specified	Springer eBooks
Public note	Online access link to the resource
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme	Library of Congress Classification
Koha item type	E-Book

Holdings
Withdrawn status	Lost status	Source of classification or shelving scheme	Not for loan	Collection code	Home library	Current library	Date acquired	Source of acquisition	Coded location qualifier	Inventory number	Total Checkouts	Full call number	Barcode	Date last seen	Copy number	Date shelved	Koha item type	Public note
		Library of Congress Classification	Geçerli değil-e-Kitap / Not applicable-e-Book	E-Kitap Koleksiyonu	Merkez Kütüphane	Merkez Kütüphane	11/10/2023	Satın Alma / Purchase		BİL		QA76.9.A43EBK	EBK03261	21/11/2023	1	21/11/2023	E-Book