Topics of Interest
Algebraic semiotics, bisimulation, Borel hierarchy, cellular automata, computational metaphysics, computational narratology, computational psychoanalysis, cryptosophy, dynamic epistemic logic, epistemic games, formal verification, game logics, hypercomputation, idempotent analysis, judgment aggregation, Krohn–Rhodes theory, λ-calculus, loop invariants, modal logic, μ-calculus, non-parametric philosophy, Oulipo, ‘patadata, π-calculus, polypoems, quines, recursive worlds, ρ-calculus, social software, surreal numbers, supertasks/hypertasks, temporal logic, Θ-combinator, topological games, type theory, ultrafilters, undecidability, viruses, Wang tiles, xenotation, Y-combinator, Yi Jing (易经), Zipf's law, zero-knowledge proofs
References – Books
- Corfield, D. (2003). Towards a Philosophy of Real Mathematics. Cambridge: Cambridge University Press.
- Cook, W. (1928). Plotto: The Master Book of All Plots. New York: Tin House Books
- Dewdney, A. (1988). The Armchair Universe: An Exploration of Computer Worlds. New York: W.H. Freeman & Co.
- Drucker, J. (2009). SpecLab: Digital Aesthetics and Projects in Speculative Computing. Chicago: University of Chicago Press.
- Grim, P., Mar, G., St. Denis, P. (1998). The Philosophical Computer: Exploratory Essays in Philosophical Computer Modeling. Cambridge, MA: MIT Press.
- Harrell, D. (2013). Phantasmal Media: An Approach to Imagination, Computation, and Expression. Cambridge: MIT Press.
- Hartman, C. (1996). Virtual Muse; Experiments in Computer Poetry. Hanover, NH: University of Wesleyan Press.
- Krohn, K. & Rhodes, J. (2010). Applications of Automata Theory and Algebra: Via the Mathematical Theory of Complexity to Biology, Physics, Philosophy and Games. World Scientific Publishing Co.
- Laruelle, F.; Edlebi, A. (trans.). (2016 [1992]). Theory of Identities. New York: Columbia University Press.
- Lewis, C. (1990). Computerizing Aristotle's categories. Ph.D Dissertation, Marquette University.
- Moldoveanu, M. & Baum, J. (2014). Epinets: The Epistemic Structure and Dynamics of Social Networks. Redwood City, CA: Stanford University Press.
- Nehaniv, C. (Ed.). (2003). Computation for Metaphors, Analogy, and Agents. Heidelberg: Springer.
- Rapaport, W. (2016). Philosophy of Computer Science. Retrieved from www.cse.buffalo.edu//~rapaport/Papers/phics.pdf
- Ramsay, S. (2011). Reading Machines: Toward an Algorithmic Criticism. Chicago: University of Illinois Press.
- Tagliabue, J. (2012). Digital Philosophy: Formal Ontology and Knowledge Representation in Cellular Automata.
Unpublished Ph.D Dissertation. Retrieved from http://www.academia.edu/1873531 - Zalta, E. (2016). Principia Logico-Metaphysica. Retrieved from http://mally.stanford.edu/principia.pdf
References – Papers
- Benzmüller, C. & Paleo, B. (2014). “Automating Gödel’s Ontological Proof of God’s Existence with Higher-order Automated Theorem Provers.” Frontiers in Artificial Intelligence and Applications 263, pp. 93-8
- Bosser, A., Cavazza, M., Ferreira, J., & Martens, C. (2013). “Linear Logic Programming for Narrative Generation.” Retrieved from http://www.cs.cmu.edu/~cmartens/lpnmr13.pdf
- de Queiroz, R. (1991) “Meaning as Grammar plus Consequences.” Dialectica 45(1), pp. 83-6
- de Queiroz, R. (1994) “Normalisation and language-games.” Dialectica 48(2), pp. 83-123
- de Queiroz, R. (2008). “On Reduction Rules, Meaning-as-Use, & Proof-Theoretic Semantics.” Studia Logica 90, pp. 211–47
- Fabbri, R., Oliveira, O., Costa, L. (2010). “Philosometrics.” Retrieved from https://arxiv.org/abs/1010.1880
- Hladik, J. (2004). “Spinoza's Ontology,” in Büchel, G., Klein, B., & Roth-Berghofer, T. (Eds.). (2004). Proceedings of the 1st Workshop on Philosophy and Informatics (WSPI 2004). DFKI: DFKI Research Reports.
- Johnson, C. (n.d.). “Daoism & Computation.” Retrieved from www.carlsensei.com/docs/essays/dao-and-computation.pdf
- Knuth, D. (1984). “The Complexity of Songs.” Communications of the ACM 27(4), pp. 344-6
- Schang, F. (n.d.). “A Formal Semantics of International Relations.” Retrieved from www.academia.edu/13790556