Category Archives: Şey

Last version: 7 September 2016

(67 pages — PDF — LaTeX)

Contents:

— Why N-1 in standard deviation?

— Conditional Counting of Qualia

— Qualia is uncertainty, uncertainty is conditional counting

— objet petit a = “less than zero” = “less than the empty set”

— Virtuality is what is left behind by conditional subtraction

— encapsulation is relativity

— relativity?

— I am white

— Postmodern Alienation Model

— Bibliography

— **THIS BOOK IS NOT AVAILABLE IN NORTH AMERICA**

Last version: 17 September 2015

(50 pages — PDF — LaTeX)

Contents:

Gameplay is politics
— Dialectics of game design
— part 1A: place of the subjective
— part 1B: action, manor of the subject
— part 1C: the real is the impasse of formalization; formalization is the place of the forced pass of the real
— part 1D: hegel: ’the activity of force is essentially the activity reacting against itself ’
— part 1E: subjective and objective

Does a digital game industry exist?
— Developing a game is developing a joint spirit
— Personal Relationships as the ground of Economy
— Players and Game Developers as Ecosystems
— Game Creation Space as a Pre-Economical Interspace
— Genre-ification of Games as the industrialization of the ecosystem
— Game Genre as a form of universal social labour-time
— What is the raw material of digital game ecosystems?
— Enthusiasm…

(Abstract accepted to Athens conference by GCAS.)

Two well-known prisoner schemes represent two different logics:
1) Prisoner’s Dilemma (PD) in Game Theory
2) Three Prisoners (TP) examined by Jacques Lacan.
Their difference concerns the dialectic of Quantity and Quality: In PD, qualities have a fixed arrangement and quantities are pre-determined as Game Rules; whereas in TP, quantities emerge only through the conditional counting of qualia. PD counts “score” under a fixed structure; whereas TP counts conditional existences. Their contexts rarely intersect: in Google, PD yields 507000 results, TP yields 345000 results, PD+TP together yields only 1310 results. There is a clear logical gap. Here, we devise a formalization to represent both as two modes of counting.

Structural counting consists of usual set theory representations:
0 = {}
1 = {0} = {{}}
2 = {0,1} = {0,{0}} = {{},{{}}}
3 = {0,1,2} = {0,{0},{0,{0}}} = {{},{{}},{{},{{}}}}
Increments: n ∪ {n}…