Switch to: References

Add citations

You must login to add citations.
  1. Hayek’s vicarious secularization of providential theology.Tim Christiaens - 2018 - Philosophy and Social Criticism 45 (1):71-95.
    Friedrich Hayek’s defense of neoliberal free market capitalism hinges on the distinction between economies and catallaxies. The former are orders instituted via planning, whereas the latter are spontaneous competitive orders resulting from human action without human design. I argue that this distinction is based on an incomplete semantic history of “economy.” By looking at the meaning of “oikonomia” in medieval providential theology as explained by Giorgio Agamben and Joseph Vogl, I argue how Hayek’s science of catallactics is itself a secularization (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • ‘You Are the Old Entrapped Dreams of the Coyote’s Brains Oozing Liquid Through the Broken Eye Socket’: Ecomonstrous poetics and weird bioregionalism in the fiction of R. A. Lafferty.Daniel Otto Jack Petersen - unknown
    The fiction of R. A. Lafferty is at once deeply ecological and deeply strange. Its incessant narrative inclusion of the nonhuman beings, places, and forces of Lafferty’s Oklahoman and otherwise western bioregion evinces an imagination profoundly porous to the local specificities and abundance of one’s more-than-human context. In this way it is deeply ecological. Lafferty’s fiction is also known as one of the most uniquely off-kilter, wildly imaginative, and arcanely erudite bodies of work in U.S. literature. In this way it (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • AI-Completeness: Using Deep Learning to Eliminate the Human Factor.Kristina Šekrst - 2020 - In Sandro Skansi (ed.), Guide to Deep Learning Basics. Springer. pp. 117-130.
    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 in polynomial time as well. A (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark