•  5
    Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved…Read more
  •  2
    Review of Syraya Chin-Mu Yang, Duen-Min Deng, Hanti Lin, Structural Analysis of Non-Classical Logics: The Proceedings of the Second Taiwan Philosophical Logic Colloquium, 278 pp.
  •  2
    In this paper we propose an non-machine learning artificial intelligence (AI) based approach for telecom data analysis, with a special focus on clique detection. Clique detection can be used to identify households, which is a major challenge in telecom data analysis and predictive analytics. Our approach does not use any form of machine learning, but another type of algorithm: satisfiability for propositional logic. This is a neglected approach in modern AI, and we aim to demonstrate that for ce…Read more
  •  2
    Much ado about nothing: cosmological and anthropic limits of quantum fluctuations
    In Luka Boršić, Dragan Poljak, Ivana Skuhala Karasman & Franjo Sokolić (eds.), Physics and Philosophy II, Institute For Philosophy Zagreb. pp. 105-114. 2020.
    This paper deals with the philosophical issues of the notion of nothingness and pre-inflationary stage of the universe in physical cosmology. We presuppose that, in addition to cosmological limits, there may be both anthropic and computational limits for our ability to understand and replicate the conditions before the Big Bang. That is, the very notion of nothingness and pre-Big Bang state may be conceptually, but not computationally grasped.