default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Gauvrit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Hector Zenil, Fernando Soler-Toscano
, Nicolas Gauvrit:
Methods and Applications of Algorithmic Complexity - Beyond Statistical Lossless Compression. Springer 2022, ISBN 978-3-662-64983-1, pp. 3-256- 2021
- [j4]Vera Kempe, Nicolas Gauvrit, Nikolay Panayotov, Sheila Cunningham, Monica Tamariz:
Amount of Learning and Signal Stability Modulate Emergence of Structure and Iconicity in Novel Signaling Systems. Cogn. Sci. 45(11) (2021)
2010 – 2019
- 2017
- [j3]Nicolas Gauvrit, Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Peter C. Brugger:
Human behavioral complexity peaks at age 25. PLoS Comput. Biol. 13(4) (2017) - [c3]Vera Kempe, Kamil Cichon, Nicolas Gauvrit, Monica Tamariz:
Iterated Teaching Can Optimise Language Functionality. CogSci 2017 - 2015
- [j2]Héctor Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Comput. Sci. 1: e23 (2015) - [c2]Mustapha Chekaf, Nicolas Gauvrit, Alessandro Guida, Fabien Mathy:
Chunking in Working Memory and its Relationship to Intelligence. CogSci 2015 - [i7]Nicolas Gauvrit, Hector Zenil, Jesper Tegnér:
The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial Cognition. CoRR abs/1501.04242 (2015) - [i6]Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil:
Natural scene statistics mediate the perception of image complexity. CoRR abs/1509.03970 (2015) - 2014
- [i5]Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano, Hector Zenil:
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method. CoRR abs/1409.4080 (2014) - 2013
- [j1]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. Comput. 2(2): 125-140 (2013) - 2012
- [i4]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines. CoRR abs/1211.1302 (2012) - [i3]Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit:
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures. CoRR abs/1211.4891 (2012) - [i2]Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit:
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility. CoRR abs/1212.6745 (2012) - 2011
- [i1]Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye:
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach. CoRR abs/1106.3059 (2011)
2000 – 2009
- 2007
- [c1]Nicolas Gauvrit:
A Locally Logical Model for Natural Semantics. FCS 2007: 89-93
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
