Fernando Soler-Toscano
Orcid: 0000-0003-1953-4136
According to our database1,
Fernando Soler-Toscano
authored at least 44 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Frontiers Comput. Neurosci., February, 2023
2022
What lies underneath: Precise classification of brain states using time-dependent topological structure of dynamics.
PLoS Comput. Biol., September, 2022
Methods and Applications of Algorithmic Complexity - Beyond Statistical Lossless Compression
44, Springer, ISBN: 978-3-662-64983-1, 2022
2019
Informational Structures and Informational Fields as a Prototype for the Description of Postulates of the Integrated Information Theory.
Entropy, 2019
Fractal dimension analysis of states of consciousness and unconsciousness using transcranial magnetic stimulation.
Comput. Methods Programs Biomed., 2019
2018
PLoS Comput. Biol., 2018
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
Entropy, 2018
2017
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences.
Complex., 2017
2016
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
CoRR, 2016
2015
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility.
PeerJ Comput. Sci., 2015
Proceedings of the Advances in Artificial Intelligence, 2015
2014
J. Log. Lang. Inf., 2014
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method.
CoRR, 2014
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014
2013
Theor. Comput. Sci., 2013
An epistemic and dynamic approach to abductive reasoning: Abductive problem and abductive solution.
J. Appl. Log., 2013
An epistemic and dynamic approach to abductive reasoning: selecting the best explanation.
Log. J. IGPL, 2013
Graph Automorphism and Topological Characterization of Synthetic and Natural Complex Networks by Information Content.
CoRR, 2013
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures.
Comput., 2013
2012
Minds Mach., 2012
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
CoRR, 2012
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
CoRR, 2012
Proceedings of the Highlights on Practical Applications of Agents and Multi-Agent Systems, 2012
Proceedings of the Highlights on Practical Applications of Agents and Multi-Agent Systems, 2012
2011
Searching for the Unity of Science: From Classical Logic to Abductive Logical Systems.
Proceedings of the Otto Neurath and the Unity of Science, 2011
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines.
Int. J. Unconv. Comput., 2011
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
CoRR, 2011
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011
2010
Proceedings of The Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW 2010), Lyon, France, August 30, 2010
2009
J. Appl. Non Class. Logics, 2009
2006
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006