Number of items at this level: 47.
Preprint
Aaronson, Scott
(2011)
Why Philosophers Should Care About Computational Complexity.
[Preprint]
Boge, Florian J. and Grünke, Paul
(2019)
Computer simulations, machine learning and the Laplacean demon: Opacity in the case of high energy physics∗.
[Preprint]
Cuffaro, Michael E.
(2021)
The Philosophy of Quantum Computing.
[Preprint]
Cuffaro, Michael E.
(2016)
Reconsidering No-Go Theorems from a Practical Perspective.
[Preprint]
Cuffaro, Michael E.
(2018)
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.
[Preprint]
Dewhurst, Joe
(2020)
There Is No Such Thing As Miscomputation.
[Preprint]
Floridi, Luciano
(2007)
A Defence of Informational Structural Realism.
[Preprint]
Floridi, Luciano
(2005)
Informational Realism.
[Preprint]
Floridi, Luciano
(2005)
Is Information Meaningful Data?
[Preprint]
Floridi, Luciano
(2004)
Outline of a Theory of Strongly Semantic Information.
[Preprint]
Hagar, Amit and Korolev, Alex
(2007)
Quantum Hypercomputation - Hype or Computation?
[Preprint]
Hewitt, Carl
(2019)
For Cybersecurity, Computer Science Must Rely on Strongly-Typed Actors.
[Preprint]
Hewitt, Carl
(2019)
For Cybersecurity, Computer Science Must Rely on Strongly-Typed Actors.
[Preprint]
Hewitt, Carl
(2019)
For Cybersecurity, Computer Science Must Rely on the Opposite of Gödel’s Results.
[Preprint]
Horner, Jack K. and Symons, John
(2020)
What Have Google’s Random Quantum Circuit Simulation
Experiments Demonstrated about Quantum Supremacy?
[Preprint]
Jorge, Juan Pablo and Vázquez, Hernán Luis and Holik, Federico
(2024)
Valuaciones de complejidad: un marco semántico general para lenguajes proposicionales.
[Preprint]
Lombardi, Olimpia and Fortin, Sebastian and López, Cristian
(2014)
Deflating the deflationary view of information.
[Preprint]
Lombardi, Olimpia and Holik, Federico and Vanni, Leonardo
(2014)
What is Shannon information?
[Preprint]
Lombardi, Olimpia and López, Cristian and Fortin, Sebastian
(2015)
No information without manipulation.
[Preprint]
Maley, Corey J.
(2021)
The Physicality of Representation.
[Preprint]
Manchak, John Byron
(2009)
On the Possibility of Supertasks in General Relativity.
[Preprint]
Norton, John D.
(2013)
Brownian Computation is Thermodynamically Irreversible.
[Preprint]
Norton, John D.
(2019)
Weeding Landauer's Garden.
[Preprint]
Piekarski, Michał
(2023)
Incorporating (variational) free energy models into mechanisms:
the case of predictive processing under the free energy principle.
[Preprint]
Raidl, Eric
(2019)
Quick Completeness for the Evidential Conditional.
[Preprint]
Saint-Mont, Uwe
(2017)
Roads to Consciousness: Crucial steps in mental development
(2.0).
[Preprint]
Schmitz, Timothy
(2023)
On Epistemically Useful Physical Computation.
[Preprint]
Shenker, Orly R. and Hemmo, Meir
(2006)
Maxwell's Demon.
[Preprint]
Stacewicz, Paweł and Kubiak, Adam P. and Greif, Hajo
(2024)
Was Turing a (Computational) Mechanist?
[Preprint]
Sterrett, S. G.
(2012)
Bringing Up Turing's 'Child-Machine' (revised).
[Preprint]
Wallace, Rodrick
(2008)
Lurching Toward Chernobyl: Dysfunctions of Real-Time Computation.
[Preprint]
Wiggershaus, Nick
(2023)
Implementation-as: From Art & Science to Computing.
[Preprint]
Conference or Workshop Item
Cuffaro, Michael E.
(2014)
How-Possibly Explanations in (Quantum) Computer Science.
In: UNSPECIFIED.
Fortin, Sebastian and Lombardi, Olimpia and Vanni, Leonardo
(2014)
A pluralist view about information.
In: UNSPECIFIED.
Klein, Colin
(2021)
Explaining Neural Transitions through Resource Constraints.
In: UNSPECIFIED.
Krzanowski, Roman
(2017)
Minimal Information Structural Realism.
In: UNSPECIFIED.
Lombardi, Olimpia and López, Cristian
(2016)
Quantum information or quantum coding?
In: UNSPECIFIED.
Maley, Corey
(2009)
Analog and Digital, Continuous and Discrete.
In: UNSPECIFIED.
Parker, Matthew W.
(2006)
Computing the Uncomputable, or, The Discrete Charm of Second-Order Simulacra.
In: UNSPECIFIED.
(Unpublished)
Parker, Matthew W.
(2008)
Computing the Uncomputable, or, The Discrete Charm of Second-order Simulacra.
In: UNSPECIFIED.
Published Article or Volume
Koshkin, Sergiy
(2024)
Functional completeness and primitive positive decomposition of relations on finite domains.
Logic Journal of the IGPL.
ISSN 1367-0751
Koshkin, Sergiy
(2023)
Logical reduction of relations:
from relational databases to Peirce's reduction thesis.
Logic Journal of the IGPL.
ISSN 1367-0751
Krzanowski, Roman
(2016)
Towards a Formal Ontology of Information
Selected Ideas of Krzysztof Turek.
Zagadnienia Filozofoczne w Nauce (LXI).
pp. 23-53.
ISSN 0867-8286
Miłkowski, Marcin
(2018)
Objections to Computationalism: A Survey.
Roczniki Filozoficzne, 66 (3).
pp. 57-75.
ISSN 00357685
Parker, Matthew W.
(2003)
Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System.
Philosophy of Science, 70 (2).
pp. 359-382.
Parker, Matthew W.
(2005)
Undecidable Long-term Behavior in Classical Physics: Foundations, Results, and Interpretation.
Sterkenburg, Tom F.
(2018)
Universal Prediction.
This list was generated on Sat Nov 2 00:17:04 2024 EDT.