text:
@book{mouat_using_nodate,
	title = {Using {Docker}},
	isbn = {978-1-4919-1576-9},
	url = {http://shop.oreilly.com/product/0636920035671.do},
	abstract = {Docker containers offer simpler, faster, and more robust methods for developing, distributing, and running software than previously available. With this hands-on guide, you’ll learn why containers are so important, what you’ll gain by...},
	urldate = {2016-09-12},
	author = {Mouat, Adrian}
}

@misc{kane_6._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {6. {Decomposition} {Of} {Graphs}: {DirectedAcyclic} {Graph}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-24},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_5._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {5. {Decomposition} {Of} {Graphs}: {Topological} {Sort}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-24},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_4._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {4. {Decomposition} {Of} {Graphs}: {Computing} {Strongly} {Connected} {Components}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-24},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_3._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {3. {Decomposition} {Of} {Graphs}: {Connectivity}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-24},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_3._2016-1,
	address = {University of California, San Diego},
	type = {Online course},
	title = {3. {Decomposition} {Of} {Graphs}: {Strongly} {Connected} {Components}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-08},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_2._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {2. {Decomposition} {Of} {Graphs}: {Exploring} {Graphs}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-05},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{kane_1._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {1. {Decomposition} {Of} {Graphs}: {Representing} {Graphs}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-05},
	author = {Kane, David},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{levin_3._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {3. {Paths} {In} {Graphs}: {Currency} {Exchange}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-09-06},
	author = {Levin, Michael},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{levin_2._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {2. {Paths} {In} {Graphs}: {Fastest} {Route}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-09-06},
	author = {Levin, Michael},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@misc{levin_1._2016,
	address = {University of California, San Diego},
	type = {Online course},
	title = {1. {Paths} {In} {Graphs}: {Most} {Direct} {Route}},
	url = {https://www.coursera.org/learn/algorithms-on-graphs/home/week/1},
	language = {English},
	urldate = {2016-08-31},
	author = {Levin, Michael},
	year = {2016},
	keywords = {vveitas:graphical\_models}
}

@book{bruno_siciliano_springer_2008,
	edition = {1},
	title = {Springer {Handbook} of {Robotics}},
	isbn = {3-540-23957-X 978-3-540-23957-4},
	publisher = {Springer},
	author = {Bruno Siciliano, Oussama Khatib},
	year = {2008}
}

@book{sanjoy_dasgupta_algorithms_2008,
	edition = {1},
	title = {Algorithms},
	isbn = {0-07-352340-2 978-0-07-352340-8},
	publisher = {McGraw-Hill Science/Engineering/Math},
	author = {Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani},
	year = {2008},
	keywords = {vveitas:graphical\_models, vveitas:offer\_networks}
}

@inproceedings{hong_fast_2013,
	title = {On fast parallel detection of strongly connected components ({SCC}) in small-world graphs},
	booktitle = {Proceedings of the {International} {Conference} on {High} {Performance} {Computing}, {Networking}, {Storage} and {Analysis}},
	publisher = {ACM},
	author = {Hong, Sungpack and Rodia, Nicole C and Olukotun, Kunle},
	year = {2013},
	keywords = {vveitas:offer\_networks},
	pages = {92}
}

@unpublished{thomas_smart_2014,
	type = {White {Paper}},
	title = {Smart {Oracles}: {A} {Simple}, {Powerful} {Approach} to {Smart} {Contracts}},
	url = {https://github.com/codius/codius/wiki/Smart-Oracles:-A-Simple,-Powerful-Approach-to-Smart-Contracts},
	language = {English},
	urldate = {2016-08-18},
	author = {Thomas, Stefan and Schwartz, Evan},
	month = jul,
	year = {2014},
	keywords = {vveitas:blockchain}
}

@inproceedings{buldas_keyless_2013,
	title = {Keyless signatures’ infrastructure: {How} to build global distributed hash-trees},
	booktitle = {Nordic {Conference} on {Secure} {IT} {Systems}},
	publisher = {Springer},
	author = {Buldas, Ahto and Kroonmaa, Andres and Laanoja, Risto},
	year = {2013},
	keywords = {vveitas:blockchain},
	pages = {313--320}
}

@article{crosby_blockchain_2016,
	title = {{BlockChain} {Technology}: {Beyond} {Bitcoin}},
	language = {English},
	number = {2},
	journal = {Applied Innovation Review},
	author = {Crosby, Michael and Nachiappan and Pattanayak, Pradan and Verma, Sanjeev and Kalyanaraman, Vignesh},
	month = jun,
	year = {2016},
	keywords = {vveitas:blockchain}
}

@book{ratner_statistical_2011,
	edition = {2},
	title = {Statistical and {Machine}-{Learning} {Data} {Mining}: {Techniques} for {Better} {Predictive} {Modeling} and {Analysis} of {Big} {Data}, {Second} {Edition}},
	isbn = {1-4398-6091-2 978-1-4398-6091-5},
	publisher = {CRC Press},
	author = {Ratner, Bruce},
	year = {2011},
	keywords = {vveitas:data\_mining}
}

@article{the_five_graces_group_language_2009,
	title = {Language {Is} a {Complex} {Adaptive} {System}: {Position} {Paper}},
	volume = {59},
	issn = {00238333, 14679922},
	shorttitle = {Language {Is} a {Complex} {Adaptive} {System}},
	url = {http://libra.msra.cn/Publication/14211124/language-is-a-complex-adaptive-system-position-paper},
	doi = {10.1111/j.1467-9922.2009.00533.x},
	urldate = {2013-07-13},
	journal = {Language Learning},
	author = {{The "Five Graces Group"} and Beckner, Clay and Blythe, Richard and Bybee, Joan and Christiansen, Morten H. and Croft, William and Ellis, Nick C. and Holland, John and Ke, Jinyun and Larsen-Freeman, Diane and Schoenemann, Tom},
	month = dec,
	year = {2009},
	pages = {1--26},
	file = {BecknerEtAl.2009.LanguageIsAcomplexAdaptiveSystem.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/BecknerEtAl.2009.LanguageIsAcomplexAdaptiveSystem.pdf:application/pdf}
}

@article{hinton_how_1987,
	title = {How learning can guide evolution},
	volume = {1},
	number = {3},
	journal = {Complex systems},
	author = {Hinton, Geoffrey E and Nowlan, Steven J},
	year = {1987},
	pages = {495--502}
}

@inproceedings{julstrom_comparing_1999,
	title = {Comparing {Darwinian}, {Baldwinian}, and {Lamarckian} search in a genetic algorithm for the 4-cycle problem},
	booktitle = {Late {Breaking} {Papers} at the 1999 {Genetic} and {Evolutionary} {Computation} {Conference}},
	publisher = {Citeseer},
	author = {Julstrom, Bryant A},
	year = {1999},
	pages = {134--138}
}

@misc{harrigan_deep_nodate,
	address = {The New School, New York City},
	type = {Conference {Talk}},
	title = {Deep {Learning} for {Artificial} {General} {Intelligence}: {Survey} of {Recent} {Developments}},
	language = {English},
	author = {Harrigan, Cosmo}
}

@book{bas_steunebrink_artificial_2016,
	edition = {1},
	series = {Lecture {Notes} in {Computer} {Science} 9782},
	title = {Artificial {General} {Intelligence}: 9th {International} {Conference}, {AGI} 2016, {New} {York}, {NY}, {USA}, {July} 16-19, 2016, {Proceedings}},
	isbn = {978-3-319-41648-9 978-3-319-41649-6},
	url = {http://gen.lib.rus.ec/book/index.php?md5=A5D0AABAA0E9517D5833E61522496F7B},
	publisher = {Springer International Publishing},
	author = {Bas Steunebrink, Pei Wang, Ben Goertzel (eds.)},
	year = {2016}
}

@book{jordi_bieger_artificial_2015,
	edition = {1},
	series = {Lecture {Notes} in {Computer} {Science} 9205},
	title = {Artificial {General} {Intelligence}: 8th {International} {Conference}, {AGI} 2015, {AGI} 2015, {Berlin}, {Germany}, {July} 22-25, 2015, {Proceedings}},
	isbn = {978-3-319-21364-4 978-3-319-21365-1},
	url = {http://gen.lib.rus.ec/book/index.php?md5=08971F876E6A24600A5A438FAF9040ED},
	publisher = {Springer International Publishing},
	author = {Jordi Bieger, Ben Goertzel, Alexey Potapov (eds.)},
	year = {2015},
	keywords = {vveitas:general\_artificial\_intelligence}
}

@article{deacon_complexity_2014,
	title = {Complexity and {Dynamical} {Depth}},
	volume = {5},
	copyright = {http://creativecommons.org/licenses/by/3.0/},
	url = {http://www.mdpi.com/2078-2489/5/3/404},
	doi = {10.3390/info5030404},
	abstract = {We argue that a critical difference distinguishing machines from organisms and computers from brains is not complexity in a structural sense, but a difference in dynamical organization that is not well accounted for by current complexity measures. We propose a measure of the complexity of a system that is largely orthogonal to computational, information theoretic, or thermodynamic conceptions of structural complexity. What we call a system’s dynamical depth is a separate dimension of system complexity that measures the degree to which it exhibits discrete levels of nonlinear dynamical organization in which successive levels are distinguished by local entropy reduction and constraint generation. A system with greater dynamical depth than another consists of a greater number of such nested dynamical levels. Thus, a mechanical or linear thermodynamic system has less dynamical depth than an inorganic self-organized system, which has less dynamical depth than a living system. Including an assessment of dynamical depth can provide a more precise and systematic account of the fundamental difference between inorganic systems (low dynamical depth) and living systems (high dynamical depth), irrespective of the number of their parts and the causal relations between them.},
	language = {en},
	number = {3},
	urldate = {2016-07-31},
	journal = {Information},
	author = {Deacon, Terrence and Koutroufinis, Spyridon},
	month = jul,
	year = {2014},
	keywords = {vveitas:generative\_model, vveitas:levels\_of\_antifragility},
	pages = {404--423}
}

@article{chialvo_emergent_2010,
	title = {Emergent complex neural dynamics},
	volume = {6},
	doi = {10.1038/nphys1803},
	journal = {Nature Physics},
	author = {Chialvo, D. R.},
	month = oct,
	year = {2010},
	keywords = {vveitas:offer\_networks, vveitas:generative\_model, vveitas:cognitive\_development},
	pages = {744--750}
}

@article{szegedy_intriguing_2013,
	title = {Intriguing properties of neural networks},
	journal = {ArXiv e-prints},
	author = {Szegedy, C. and Zaremba, W. and Sutskever, I. and Bruna, J. and Erhan, D. and Goodfellow, I. and Fergus, R.},
	month = dec,
	year = {2013},
	keywords = {vveitas:ai}
}

@inproceedings{cheeseman_where_1991,
	address = {San Francisco, CA, USA},
	series = {{IJCAI}'91},
	title = {Where the {Really} {Hard} {Problems} {Are}},
	isbn = {978-1-55860-160-4},
	url = {http://dl.acm.org/citation.cfm?id=1631171.1631221},
	abstract = {It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P = NP). This paper shows that NP-complete problems can be summarized by at least one "order parameter", and that the hard problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for K-colorability, the critical value separates overconstrained from underconstrained random graphs, and it marks the value at which the probability of a solution changes abruptly from near 0 to near 1. It is the high density of well-separated almost solutions (local minima) at this boundary that cause search algorithms to "thrash". This boundary is a type of phase transition and we show that it is preserved under mappings between problems. We show that for some P problems either there is no phase transition or it occurs for bounded N (and so bounds the cost). These results suggest a way of deciding if a problem is in P or NP and why they are different.},
	urldate = {2016-07-31},
	booktitle = {Proceedings of the 12th {International} {Joint} {Conference} on {Artificial} {Intelligence} - {Volume} 1},
	publisher = {Morgan Kaufmann Publishers Inc.},
	author = {Cheeseman, Peter and Kanefsky, Bob and Taylor, William M.},
	year = {1991},
	keywords = {vveitas:offer\_networks},
	pages = {331--337}
}

@article{hogg_frontiers_1996,
	title = {Frontiers in {Problem} {Solving}: {Phase} {Transitions} and {ComplexityPhase} transitions and the search problem},
	volume = {81},
	issn = {0004-3702},
	shorttitle = {Frontiers in {Problem} {Solving}},
	url = {http://www.sciencedirect.com/science/article/pii/0004370295000445},
	doi = {10.1016/0004-3702(95)00044-5},
	abstract = {We describe how techniques that were originally developed in statistical mechanics can be applied to search problems that arise commonly in artificial intelligence. This approach is useful for understanding the typical behavior of classes of problems. In particular, these techniques predict that abrupt changes in computational cost, analogous to physical phase transitions, should occur universally, as heuristic effectiveness or search space topology is varied. We also present a number of open questions raised by these studies.},
	number = {1},
	urldate = {2016-07-31},
	journal = {Artificial Intelligence},
	author = {Hogg, Tad and Huberman, Bernardo A. and Williams, Colin P.},
	month = mar,
	year = {1996},
	keywords = {vveitas:offer\_networks},
	pages = {1--15}
}

@book{bak_how_1996,
	edition = {1},
	title = {How {Nature} {Works}: the science of self-organized criticality},
	isbn = {978-0-387-98738-5 978-1-4757-5426-1},
	publisher = {Copernicus},
	author = {Bak, Per},
	year = {1996}
}

@article{duch_community_2005,
	title = {Community detection in complex networks using extremal optimization},
	volume = {72},
	url = {http://link.aps.org/doi/10.1103/PhysRevE.72.027104},
	doi = {10.1103/PhysRevE.72.027104},
	abstract = {We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.},
	number = {2},
	urldate = {2016-07-28},
	journal = {Physical Review E},
	author = {Duch, Jordi and Arenas, Alex},
	month = aug,
	year = {2005},
	keywords = {vveitas:offer\_networks, vveitas:generative\_model},
	pages = {027104}
}

@inproceedings{boettcher_extremal_1999,
	title = {Extremal optimization: {Methods} derived from co-evolution},
	booktitle = {Proceedings of the 1st {Annual} {Conference} on {Genetic} and {Evolutionary} {Computation}-{Volume} 1},
	publisher = {Morgan Kaufmann Publishers Inc.},
	author = {Boettcher, Stefan and Percus, Allon G},
	year = {1999},
	keywords = {vveitas:offer\_networks},
	pages = {825--832}
}

@article{duch_community_2005-1,
	title = {Community detection in complex networks using extremal optimization},
	volume = {72},
	url = {http://link.aps.org/doi/10.1103/PhysRevE.72.027104},
	doi = {10.1103/PhysRevE.72.027104},
	abstract = {We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other approaches. The efficiency and accuracy of the method make it feasible to be used for the accurate identification of community structure in large complex networks.},
	number = {2},
	urldate = {2016-07-27},
	journal = {Physical Review E},
	author = {Duch, Jordi and Arenas, Alex},
	month = aug,
	year = {2005},
	pages = {027104}
}

@book{wikipedia_extremal_2013,
	title = {Extremal optimization — {Wikipedia}, {The} {Free} {Encyclopedia}},
	url = {https://en.wikipedia.org/w/index.php?title=Extremal_optimization&oldid=534197044},
	author = {{Wikipedia}},
	year = {2013},
	note = {[Online; accessed 27-July-2016]},
	keywords = {vveitas:offer\_networks}
}

@article{hesse_self-organized_2014,
	title = {Self-organized criticality as a fundamental property of neural systems},
	volume = {8},
	url = {http://journal.frontiersin.org/article/10.3389/fnsys.2014.00166/full#B3},
	doi = {10.3389/fnsys.2014.00166},
	abstract = {The neural criticality hypothesis states that the brain may be poised in a critical state at a boundary between different types of dynamics. Theoretical and experimental studies show that critical systems often exhibit optimal computational properties, suggesting the possibility that criticality has been evolutionarily selected as a useful trait for our nervous system. Evidence for criticality has been found in cell cultures, brain slices, and anesthetized animals. Yet, inconsistent results were reported for recordings in awake animals and humans, and current results point to open questions about the exact nature and mechanism of criticality, as well as its functional role. Therefore, the criticality hypothesis has remained a controversial proposition. Here, we provide an account of the mathematical and physical foundations of criticality. In the light of this conceptual framework, we then review and discuss recent experimental studies with the aim of identifying important next steps to be taken and connections to other fields that should be explored.},
	urldate = {2016-07-26},
	journal = {Frontiers in Systems Neuroscience},
	author = {Hesse, Janina and Gross, Thilo},
	year = {2014},
	keywords = {vveitas:offer\_networks, vveitas:generative\_model},
	pages = {166}
}

@article{bak_self-organized_1988,
	title = {Self-organized criticality},
	volume = {38},
	number = {1},
	journal = {Physical review A},
	author = {Bak, Per and Tang, Chao and Wiesenfeld, Kurt},
	year = {1988},
	pages = {364}
}

@article{reidys_combinatorial_2002,
	title = {Combinatorial landscapes},
	volume = {44},
	number = {1},
	journal = {SIAM review},
	author = {Reidys, Christian M and Stadler, Peter F},
	year = {2002},
	keywords = {vveitas:offer\_networks},
	pages = {3--54}
}

@article{liu_self-organized_2011,
	title = {Self-organized combinatorial optimization},
	volume = {38},
	issn = {0957-4174},
	url = {http://www.sciencedirect.com/science/article/pii/S0957417411003095},
	doi = {10.1016/j.eswa.2011.02.103},
	abstract = {In this paper, we present a self-organized computing approach to solving hard combinatorial optimization problems, e.g., the traveling salesman problem (TSP). First of all, we provide an analytical characterization of such an approach, by means of formulating combinatorial optimization problems into autonomous multi-entity systems and thereafter examining the microscopic characteristics of optimal solutions with respect to discrete state variables and local fitness functions. Next, we analyze the complexity of searching in the solution space based on the representation of fitness network and the observation of phase transition. In the second part of the paper, following the analytical characterization, we describe a decentralized, self-organized algorithm for solving combinatorial optimization problems. The validation results obtained by testing on a set of benchmark TSP instances have demonstrated the effectiveness and efficiency of the proposed algorithm. The link established between the microscopic characterization of hard computational systems and the design of self-organized computing methods provides a new way of studying and tackling hard combinatorial optimization problems.},
	number = {8},
	urldate = {2016-07-19},
	journal = {Expert Systems with Applications},
	author = {Liu, Jiming and Chen, Yu-Wang and Yang, Gen-Ke and Lu, Yong-Zai},
	month = aug,
	year = {2011},
	keywords = {vveitas:offer\_networks},
	pages = {10532--10540}
}

@incollection{wang_emotional_2016,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {The {Emotional} {Mechanisms} in {NARS}},
	copyright = {©2016 Springer International Publishing Switzerland},
	isbn = {978-3-319-41648-9 978-3-319-41649-6},
	url = {http://link.springer.com/chapter/10.1007/978-3-319-41649-6_15},
	abstract = {This paper explains the conceptual design and experimental implementation of the components of NARS that are directly related to emotion. It is argued that emotion is necessary for an AGI system that has to work with insufficient knowledge and resources. This design is also compared to the other approaches in AGI research, as well as to the relevant aspects in the human brain.},
	language = {en},
	number = {9782},
	urldate = {2016-07-19},
	booktitle = {Artificial {General} {Intelligence}},
	publisher = {Springer International Publishing},
	author = {Wang, Pei and Talanov, Max and Hammer, Patrick},
	editor = {Steunebrink, Bas and Wang, Pei and Goertzel, Ben},
	month = jul,
	year = {2016},
	doi = {10.1007/978-3-319-41649-6_15},
	keywords = {vveitas:generative\_model},
	pages = {150--159}
}

@incollection{rosenbloom_rethinking_2016,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Rethinking {Sigma}’s {Graphical} {Architecture}: {An} {Extension} to {Neural} {Networks}},
	copyright = {©2016 Springer International Publishing Switzerland},
	isbn = {978-3-319-41648-9 978-3-319-41649-6},
	shorttitle = {Rethinking {Sigma}’s {Graphical} {Architecture}},
	url = {http://link.springer.com/chapter/10.1007/978-3-319-41649-6_9},
	abstract = {The status of Sigma’s grounding in graphical models is challenged by the ways in which their semantics has been violated while incorporating rule-based reasoning into them. This has led to a rethinking of what goes on in its graphical architecture, with results that include a straightforward extension to feedforward neural networks (although not yet with learning).},
	language = {en},
	number = {9782},
	urldate = {2016-07-19},
	booktitle = {Artificial {General} {Intelligence}},
	publisher = {Springer International Publishing},
	author = {Rosenbloom, Paul S. and Demski, Abram and Ustun, Volkan},
	editor = {Steunebrink, Bas and Wang, Pei and Goertzel, Ben},
	month = jul,
	year = {2016},
	doi = {10.1007/978-3-319-41649-6_9},
	keywords = {vveitas:graphical\_models},
	pages = {84--94}
}

@incollection{potapov_real-time_2016,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Real-{Time} {GA}-{Based} {Probabilistic} {Programming} in {Application} to {Robot} {Control}},
	copyright = {©2016 Springer International Publishing Switzerland},
	isbn = {978-3-319-41648-9 978-3-319-41649-6},
	url = {http://link.springer.com/chapter/10.1007/978-3-319-41649-6_10},
	abstract = {Possibility to solve the problem of planning and plan recovery for robots using probabilistic programming with optimization queries, which is being developed as a framework for AGI and cognitive architectures, is considered. Planning can be done directly by introducing a generative model for plans and optimizing an objective function calculated via plan simulation. Plan recovery is achieved almost without modifying optimization queries. These queries are simply executed in parallel with plan execution by a robot meaning that they continuously optimize dynamically varying objective functions tracking their optima. Experiments with the NAO robot showed that replanning can be naturally done within this approach without developing special plan recovery methods.},
	language = {en},
	number = {9782},
	urldate = {2016-07-19},
	booktitle = {Artificial {General} {Intelligence}},
	publisher = {Springer International Publishing},
	author = {Potapov, Alexey and Rodionov, Sergey and Potapova, Vita},
	editor = {Steunebrink, Bas and Wang, Pei and Goertzel, Ben},
	month = jul,
	year = {2016},
	doi = {10.1007/978-3-319-41649-6_10},
	keywords = {vveitas:graphical\_models},
	pages = {95--105}
}

@article{wang_analogy_2009,
	series = {Special {Issue} on {Analogies} - {Integrating} {Cognitive} {Abilities}},
	title = {Analogy in a general-purpose reasoning system},
	volume = {10},
	issn = {1389-0417},
	url = {http://www.sciencedirect.com/science/article/pii/S1389041708000764},
	doi = {10.1016/j.cogsys.2008.09.003},
	abstract = {This paper introduces the various forms of analogy in NARS, a general-purpose reasoning system. NARS is an AI system designed to be adaptive and to work with insufficient knowledge and resources. In the system, multiple types of inference, including analogy, deduction, induction, abduction, comparison, and revision, are unified both in syntax and in semantics. The system can also carry out relational and structural analogy, in ways comparable to (though different from) that in some other models of analogy, such as Copycat and SME. The paper addresses several theoretical issues in the study of analogy, including the specification and justification of analogy, the context sensitivity of analogy, as well as the role analogy plays in intelligence and cognition.},
	number = {3},
	urldate = {2016-07-17},
	journal = {Cognitive Systems Research},
	author = {Wang, Pei},
	month = sep,
	year = {2009},
	pages = {286--296}
}

@article{xu_frame_2012,
	title = {The frame problem, the relevance problem, and a package solution to both},
	volume = {187},
	issn = {0039-7857},
	url = {http://www.jstor.org/stable/41681621},
	abstract = {As many philosophers agree, the frame problem is concerned with how an agent may efficiently filter out irrelevant information in the process of problem-solving. Hence, how to solve this problem hinges on how to properly handle semantic relevance in cognitive modeling, which is an area of cognitive science that deals with simulating human's cognitive processes in a computerized model. By "semantic relevance", we mean certain inferential relations among acquired beliefs which may facilitate information retrieval and practical reasoning under certain epistemic constraints, e. g., the insufficiency of knowledge, the limitation of time budget, etc. However, traditional approaches to relevance—as for example, relevance logic, the Bayesian approach, as well as Description Logic—have failed to do justice to the foregoing constraints, and in this sense, they are not proper tools for solving the frame problem/relevance problem. As we will argue in this paper, Non-Axiomatic Reasoning System (NARS) can handle the frame problem in a more proper manner, because the resulting solution seriously takes epistemic constraints on cognition as a fundamental theoretical principle.},
	urldate = {2016-07-17},
	journal = {Synthese},
	author = {Xu, Yingjin and Wang, Pei},
	year = {2012},
	pages = {43--72}
}

@misc{wang_nars:_2016,
	address = {New York, NY},
	title = {{NARS}: {An} {Artificial} {General} {Intelligence} {Project}},
	author = {Wang, Pei and Open NARS Team},
	year = {2016}
}

@article{newman_models_2000,
	title = {Models of the {Small} {World}},
	volume = {101},
	issn = {0022-4715, 1572-9613},
	url = {http://link.springer.com/article/10.1023/A%3A1026485807148},
	doi = {10.1023/A:1026485807148},
	abstract = {It is believed that almost any pair of people in the world can be connected to one another by a short chain of intermediate acquaintances, of typical length about six. This phenomenon, colloquially referred to as the “six degrees of separation,” has been the subject of considerable recent interest within the physics community. This paper provides a short review of the topic.},
	language = {en},
	number = {3-4},
	urldate = {2016-07-13},
	journal = {Journal of Statistical Physics},
	author = {Newman, M. E. J.},
	month = nov,
	year = {2000},
	keywords = {vveitas:offer\_networks},
	pages = {819--841}
}

@book{lewis_network_2009,
	title = {Network {Science} - {Theory} and {Applications}},
	isbn = {0-470-33188-7 978-0-470-33188-0},
	url = {http://gen.lib.rus.ec/book/index.php?md5=1F1D839D4B8CCDCC2CD77972BC26F634},
	publisher = {Wiley},
	author = {Lewis, Ted G.},
	year = {2009},
	keywords = {vveitas:offer\_networks}
}

@article{liu_toward_2012,
	title = {Toward understanding the optimization of complex systems},
	volume = {38},
	number = {4},
	journal = {Artificial Intelligence Review},
	author = {Liu, Jiming and Chen, Yu-Wang},
	year = {2012},
	keywords = {vveitas:offer\_networks},
	pages = {313--324}
}

@article{kleinberg_small-world_2004,
	title = {The small-world phenomenon and decentralized search},
	volume = {37},
	number = {3},
	journal = {SiAM News},
	author = {Kleinberg, Jon},
	year = {2004},
	keywords = {vveitas:offer\_networks},
	pages = {1--2}
}

@unpublished{merkle_daos_2016,
	type = {Working {Paper} {Draft}},
	title = {{DAOs}, {Democracy} and {Governance}},
	url = {http://merkle.com/papers/DAOdemocracyDraft.pdf},
	language = {English},
	author = {Merkle, Ralph C.},
	month = may,
	year = {2016}
}

@incollection{merkle_certified_1989,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {A {Certified} {Digital} {Signature}},
	copyright = {©1990 Springer-Verlag Berlin Heidelberg},
	isbn = {978-0-387-97317-3 978-0-387-34805-6},
	url = {http://link.springer.com/chapter/10.1007/0-387-34805-0_21},
	abstract = {A practical digital signature system based on a conventional encryption function which is as secure as the conventional encryption function is described. Since certified conventional systems are available it can be implemented quickly, without the several years delay required for certification of an untested system.},
	language = {en},
	number = {435},
	urldate = {2016-06-29},
	booktitle = {Advances in {Cryptology} — {CRYPTO}’ 89 {Proceedings}},
	publisher = {Springer New York},
	author = {Merkle, Ralph C.},
	editor = {Brassard, Gilles},
	month = aug,
	year = {1989},
	doi = {10.1007/0-387-34805-0_21},
	keywords = {vveitas:blockchain},
	pages = {218--238}
}

@book{valiant_probably_2013,
	edition = {Reprint edition},
	title = {Probably {Approximately} {Correct}: {Nature}'s {Algorithms} for {Learning} and {Prospering} in a {Complex} {World}},
	shorttitle = {Probably {Approximately} {Correct}},
	abstract = {We have effective theories for very few things. Gravity is one, electromagnetism another. But for most things—whether as mundane as finding a mate or as major as managing an economy—our theories are lousy or nonexistent. Fortunately, we don’t need them, any more than a fish needs a theory of water to swim; we’re able to muddle through. But how do we do it? In Probably Approximately Correct, computer scientist Leslie Valiant presents a theory of the theoryless. The key is “probably approximately correct” learning, Valiant’s model of how anything can act without needing to understand what is going on. The study of probably approximately correct algorithms reveals the shared computational nature of evolution and cognition, indicates how computers might possess authentic intelligence, and shows why hacking a problem can be far more effective than developing a theory to explain it. After all, finding a mate is a lot more satisfying than finding a theory of mating.Offering an elegant, powerful model that encompasses all of life’s complexity, Probably Approximately Correct will revolutionize the way we look at the universe’s greatest mysteries.},
	language = {English},
	publisher = {Basic Books},
	author = {Valiant, Leslie},
	month = jun,
	year = {2013},
	keywords = {vveitas:machine\_learning}
}

@article{dimaggio_exploiting_2013,
	title = {Exploiting affinities between topic modeling and the sociological perspective on culture: {Application} to newspaper coverage of {US} government arts funding},
	volume = {41},
	number = {6},
	journal = {Poetics},
	author = {DiMaggio, Paul and Nag, Manish and Blei, David},
	year = {2013},
	keywords = {vveitas:natural\_language\_understanding},
	pages = {570--606}
}

@book{allen_sage_2011,
	title = {The {SAGE} {Handbook} of {Complexity} and {Management}},
	isbn = {978-1-4462-0974-5},
	abstract = {The SAGE Handbook of Complexity and Management is the first substantive scholarly work to provide a map of the state of art research in the growing field emerging at the intersection of complexity science and management studies. Edited and written by internationally respected scholars from management and related disciplines, the Handbook will be the definitive reference source for understanding the implications of complexity science for management research and practice.  Part One: Foundations introduces complexity science and its implications for the foundations of scientific knowledge, including management knowledge.  Part Two: Applications presents the numerous ways in which complexity science models and tools, as well as complexity thinking, are being applied to management and organizational phenomena and the insights gained as a result.  Part Three: Interfaces highlights how complexity science is transforming various non-management fields and, in so doing, creating exciting interfaces for bridging between management and related disciplines.},
	language = {en},
	publisher = {SAGE},
	author = {Allen, Peter and Maguire, Steve and McKelvey, Bill},
	month = mar,
	year = {2011}
}

@article{nanas_autopoiesis_2008,
	title = {Autopoiesis, the immune system, and adaptive information filtering},
	volume = {8},
	issn = {1567-7818, 1572-9796},
	url = {http://link.springer.com/article/10.1007/s11047-008-9068-x},
	doi = {10.1007/s11047-008-9068-x},
	abstract = {Adaptive information filtering is a challenging and fascinating problem. It requires the adaptation of a representation of a user’s multiple interests to various changes in them. We tackle this dynamic problem with Nootropia, a model inspired by the autopoietic view of the immune system. It is based on a self-organising antibody network that reacts to user feedback in order to define and preserve the user interests. We describe Nootropia in the context of adaptive, content-based document filtering and evaluate it using virtual users. The results demonstrate Nootropia’s ability to adapt to both short-term variations and more radical changes in the user’s interests, and to dynamically control its size and connectivity in the process. Advantages over existing approaches to profile adaptation, such as learning algorithms and evolutionary algorithms are also highlighted.},
	language = {en},
	number = {2},
	urldate = {2016-06-17},
	journal = {Natural Computing},
	author = {Nanas, Nikolaos and Roeck, Anne de},
	month = apr,
	year = {2008},
	keywords = {vveitas:distributed\_intelligence},
	pages = {387--427}
}

@article{mengistu_evolutionary_2016,
	title = {The {Evolutionary} {Origins} of {Hierarchy}},
	volume = {12},
	issn = {1553-7358},
	url = {http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004829},
	doi = {10.1371/journal.pcbi.1004829},
	abstract = {Author Summary   Hierarchy is a ubiquitous organizing principle in biology, and a key reason evolution produces complex, evolvable organisms, yet its origins are poorly understood. Here we demonstrate for the first time that hierarchy evolves as a result of the costs of network connections. We confirm a previous finding that connection costs drive the evolution of modularity, and show that they also cause the evolution of hierarchy. We further confirm that hierarchy promotes evolvability in addition to evolvability caused by modularity. Because many biological and human-made phenomena can be represented as networks, and because hierarchy is a critical network property, this finding is immediately relevant to a wide array of fields, from biology, sociology, and medical research to harnessing evolution for engineering.},
	number = {6},
	urldate = {2016-06-16},
	journal = {PLOS Comput Biol},
	author = {Mengistu, Henok and Huizinga, Joost and Mouret, Jean-Baptiste and Clune, Jeff},
	month = jun,
	year = {2016},
	keywords = {vveitas:generative\_model, vveitas:distributed\_intelligence},
	pages = {e1004829}
}

@book{mougayar_business_2016,
	edition = {1 edition},
	title = {The {Business} {Blockchain}: {Promise}, {Practice}, and {Application} of the {Next} {Internet} {Technology}},
	isbn = {978-1-119-30031-1},
	shorttitle = {The {Business} {Blockchain}},
	abstract = {The definitive pioneering blueprint covering the what, why and how of the blockchain.  Blockchains are new technology layers that rewire the Internet and threaten to side-step older legacy constructs and centrally served businesses. At its core, a blockchain injects trust into the network, cutting off some intermediaries from serving that function and creatively disrupting how they operate. Metaphorically, blockchains are the ultimate non-stop computers. Once launched, they never go down, and offer an incredible amount of resiliency, making them dependable and attractive for running a new generation of decentralized services and software applications.  The Business Blockchain charts new territory in advancing our understanding of the blockchain by unpacking its elements like no other before. William Mougayar anticipates a future that consists of thousands, if not millions of blockchains that will enable not only frictionless value exchange, but also a new flow of value, redefining roles, relationships, power and governance. In this book, Mougayar makes two other strategic assertions. First, the blockchain has polymorphic characteristics; its application will result in a multiplicity of effects. Second, we shouldn’t ask ourselves what problems the blockchain solves, because that gives us a narrow view on its potential. Rather, we should imagine new opportunities, and tackle even more ambitious problems that cross organizational, regulatory and mental boundaries.  Drawing on 34 years of technology industry experience as an executive, analyst, consultant, entrepreneur, startup mentor, author, blogger, educator, thought leader and investor, William Mougayar describes a future that is influenced by fundamental shifts brought by blockchain technology as the catalyst for change. William Mougayar has been described as the most sophisticated blockchain business thinker. He is a blockchain industry insider whose work has already shaped and influenced the understanding of blockchain for people around the world, via his generous blogging and rigorous research insights. He is a direct participant in the crypto-technology market, working alongside startups, entrepreneurs, pioneers, leaders, innovators, creators, enterprise executives and practitioners; in addition to being an investor, advisor, and board member in some of the leading organizations in this space, such as the Ethereum Foundation, OpenBazaar and Coin Center. Just as the Internet created new possibilities that we didn’t foresee in its early years, the blockchain will give rise to new business models and ideas that may still be invisible. Following an engaging Foreword by Vitalik Buterin, this book is organized along these 7 chapters: 1. What is the Blockchain? 2. How Blockchain Trust Infiltrates 3. Obstacles, Challenges \& Mental Blocks 4. Blockchain in Financial Services 5. Lighthouse Industries \& New Intermediaries 6. Implementing Blockchain Technology 7. Decentralization as the Way Forward The Business Blockchain is an invitation for technologists to better understand the business potential of the blockchain, and for business minded people to grasp the many facets of blockchain technology. This book teaches you how to think about the blockchain.},
	language = {English},
	publisher = {Wiley},
	author = {Mougayar, William},
	month = may,
	year = {2016}
}

@unpublished{jentzsch_decantralized_2016,
	type = {White {Paper}},
	title = {Decantralized {Autonomous} {Organization} {To} {Automate} {Governance}},
	url = {https://download.slock.it/public/DAO/WhitePaper.pdf},
	abstract = {This paper describes the first implementation of Decentralized Autonomous Organization (DAO) code to
automate organizational governance and decision-making. The code can be used by individuals working together
collaboratively outside of a traditional corporate form. It can also be used by a registered corporate entity to automate
formal governance rules contained in corporate bylaws or imposed by law. First the DAO concept is described, then
minority rights is discussed, and a solution to a “robbing the minority” attack vector is proposed. Finally, a practical
implementation of a first generation DAO entity is provided using smart contracts written in Solidity on the Ethereum
blockchain.},
	language = {English},
	author = {Jentzsch, Christopher},
	month = apr,
	year = {2016}
}

@phdthesis{polyvyanyy_structuring_2012,
	address = {Potsdam},
	type = {{PhD} {Thesis}},
	title = {Structuring process models},
	language = {English},
	school = {University of Potsdam},
	author = {Polyvyanyy, Artem},
	year = {2012},
	keywords = {vveitas:offer\_networks}
}

@book{domingos_master_2015,
	address = {New York},
	title = {The {Master} {Algorithm}: {How} the {Quest} for the {Ultimate} {Learning} {Machine} {Will} {Remake} {Our} {World}},
	isbn = {978-0-465-06570-7},
	shorttitle = {The {Master} {Algorithm}},
	abstract = {Algorithms increasingly run our lives. They find books, movies, jobs, and dates for us, manage our investments, and discover new drugs. More and more, these algorithms work by learning from the trails of data we leave in our newly digital world. Like curious children, they observe us, imitate, and experiment. And in the world’s top research labs and universities, the race is on to invent the ultimate learning algorithm: one capable of discovering any knowledge from data, and doing anything we want, before we even ask.Machine learning is the automation of discovery—the scientific method on steroids—that enables intelligent robots and computers to program themselves. No field of science today is more important yet more shrouded in mystery. Pedro Domingos, one of the field’s leading lights, lifts the veil for the first time to give us a peek inside the learning machines that power Google, Amazon, and your smartphone. He charts a course through machine learning’s five major schools of thought, showing how they turn ideas from neuroscience, evolution, psychology, physics, and statistics into algorithms ready to serve you. Step by step, he assembles a blueprint for the future universal learner—the Master Algorithm—and discusses what it means for you, and for the future of business, science, and society.If data-ism is today’s rising philosophy, this book will be its bible. The quest for universal learning is one of the most significant, fascinating, and revolutionary intellectual developments of all time. A groundbreaking book, The Master Algorithm is the essential guide for anyone and everyone wanting to understand not just how the revolution will happen, but how to be at its forefront.},
	language = {English},
	publisher = {Basic Books},
	author = {Domingos, Pedro},
	month = sep,
	year = {2015},
	keywords = {vveitas:machine\_learning}
}

@inproceedings{bentley_higher_2016,
	address = {Cancun, Mexico},
	title = {Higher {Order} {Cognition} using {Computers}: {Learning} {Abstract} {Concepts} with {Recursive} {Graph}-based {Self} {Organizing} {Map}},
	author = {Bentley, Peter J. and Kurashov, Alexander and Lim, Soo Ling},
	year = {2016},
	keywords = {vveitas:general\_artificial\_intelligence}
}

@inproceedings{duch_cognitive_2008,
	title = {Cognitive {Architectures}: {Where} do we go from here?},
	volume = {171},
	booktitle = {{AGI}},
	author = {Duch, Wlodzislaw and Oentaryo, Richard Jayadi and Pasquier, Michel},
	year = {2008},
	keywords = {vveitas:general\_artificial\_intelligence},
	pages = {122--136}
}

@inproceedings{rocha_distributed_2015,
	title = {Distributed cycle detection in large-scale sparse graphs},
	abstract = {In this paper we present a distributed algorithm for detecting cycles in large-scale directed graphs, along with its correctness proof and analysis. The algorithm is then extended to find strong components in directed graphs. We indicate an application to detecting cycles in number theoretic functions such as the proper divisor function. Our prototype implementation of the cycle detection algorithm, when applied to the proper divisor function, detects all sociable groups of numbers (cycles in the proper divisor function) up to \$10{\textasciicircum}7\$.},
	booktitle = {{XLVII} {SBPO} 2015 - {Simpósio} {Brasileiro} de {Pesquisa} {Operacional}},
	author = {Rocha, Rodrigo Caetano and Thatte, Bhalchandra Digambar},
	month = aug,
	year = {2015}
}

@inproceedings{rahli_logic_2012,
	title = {The {Logic} of {Events}, a framework to reason about distributed systems},
	publisher = {2012 Languages for Distributed Algorithms (LADA) workshop},
	author = {Rahli, Vincent and Bickford, Mark and Constable, Robert},
	year = {2012}
}

@book{marcus_algebraic_2003,
	address = {Cambridge, Mass.},
	title = {The {Algebraic} {Mind}: {Integrating} {Connectionism} and {Cognitive} {Science}},
	isbn = {978-0-262-63268-3},
	shorttitle = {The {Algebraic} {Mind}},
	abstract = {In  The Algebraic Mind, Gary Marcus attempts to integrate two theories about how the mind works, one that says that the mind is a computer-like manipulator of symbols, and another that says that the mind is a large network of neurons working together in parallel. Resisting the conventional wisdom that says that if the mind is a large neural network it cannot simultaneously be a manipulator of symbols, Marcus outlines a variety of ways in which neural systems could be organized so as to manipulate symbols, and he shows why such systems are more likely to provide an adequate substrate for language and cognition than neural systems that are inconsistent with the manipulation of symbols. Concluding with a discussion of how a neurally realized system of symbol-manipulation could have evolved and how such a system could unfold developmentally within the womb, Marcus helps to set the future agenda of cognitive neuroscience.},
	language = {English},
	publisher = {A Bradford Book},
	author = {Marcus, Gary F.},
	month = jan,
	year = {2003}
}

@book{huth_logic_2004,
	address = {Cambridge U.K. ; New York},
	edition = {2 edition},
	title = {Logic in {Computer} {Science}: {Modelling} and {Reasoning} about {Systems}},
	isbn = {978-0-521-54310-1},
	shorttitle = {Logic in {Computer} {Science}},
	abstract = {The second edition of this successful textbook continues to provide a clear introduction to formal reasoning relevant to the needs of modern computer science and sufficiently exacting for practical applications. Improvements have been made throughout with many new and expanded text sections. The coverage of model-checking has been substantially updated and additional exercises are included. Internet support includes worked solutions for teacher exercises and model solutions to some student exercises.   First Edition Hb (2000): 0-521-65200-6  First Edition Pb (2000): 0-521-65602-8},
	language = {English},
	publisher = {Cambridge University Press},
	author = {Huth, Michael and Ryan, Mark},
	month = aug,
	year = {2004}
}

@unpublished{goodfellow_deep_2016,
	title = {Deep {Learning}},
	url = {http://www.deeplearningbook.org},
	author = {Goodfellow, Ian and Bengio, Yoshua and Courville, Aaron},
	year = {2016},
	note = {Book in preparation for MIT Press}
}

@book{bechtel_connectionism_2002,
	address = {Oxford \& Cambridge, MA},
	title = {Connectionism and the mind: {An} introduction to parallel processing in networks.},
	shorttitle = {Connectionism and the mind},
	publisher = {Basil Blackwell},
	author = {Bechtel, W. and Abrahamsen, A.},
	year = {2002},
	file = {BechtelAbrahamsen.1991.ConnectionismAndTheMind.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/BechtelAbrahamsen.1991.ConnectionismAndTheMind.pdf:application/pdf}
}

@book{simondon_individuation_2005,
	address = {Grenoble},
	title = {L'individuation à la lumière des notions de forme et d'information [{Individuation} in light of the notions of form and information]},
	isbn = {978-2-84137-181-5},
	abstract = {De l'atomisme de Démocrite au principe d'indétermination de Heisenberg, de la pensée de l'individuel d'Aristote au retour à la chose même de Husserl, de l'ego cartésien et de la monade leibnizienne au Dasein heideggerien, la question de la genèse de l'individu n'a cessé de hanter les préoccupations des philosophes et des hommes de science. Par delà le champ d'une investigation épistémologique, qui tient compte des thèses de la thermodynamique, de la fabrication des objets techniques, de la formation des cristaux, l'originalité de Gilbert Simondon est de questionner en son fond historique et philosophique l'idée même de principe d'individuation. Attitude méthodologique qui conduit à concevoir sous un jour radicalement neuf les rapports d'empiétements et de chevauchements de l'individu à l'égard du champ transindividuel dont il émane et qui lui demeure toujours coprésent dans ses mutations et ses métamorphoses. Ni objet ni sujet purs, chaque individu, sous son apparente identité, se révèle dès lors théâtre d'individuations, où s'entrecroisent les tensions résolutrices d'un champ préindividuel formant monde. Situation qui conduit Gilbert Simondon à développer une conception renouvelée de l'information qui, par delà l'idéalisme et le réalisme emprunté aux techniques du message codé, se révèle dans sa conception de la transduction, structure d'être et acte de connaissance en voie de résolution. L'originalité de cette ø euvre est d'allier à une rigoureuse réflexion d'ordre épistémologique et technique ancrée dans notre contemporanéité, une méditation historique de la tradition qui ne craint pas de remettre en question des attitudes philosophiques qui semblaient et semblent toujours aller de soi. Il s'agit en fait de réformer nos principes et nos concepts opératoires pour aborder, sous un jour neuf, le problème crucial de l'individu. Nouvelle édition, rassemblant L'individu et sa genèse physico-biologique, paru en 1964, aux P.U.F., et L'individuation psychique et collective, paru chez Aubier en 1989, qui formaient ensemble la thèse de doctorat de Gilbert Simondon, L'Individuation à la lumière des notions de Forme et d'Information, ainsi que Histoire de la Notion d'Individu, inédit.},
	language = {Français},
	publisher = {Editions Jérôme Millon},
	author = {Simondon, Gilbert},
	month = nov,
	year = {2005}
}

@book{prigogine_order_1984,
	address = {New York},
	title = {Order out of chaos: {Man}'s new dialogue with nature},
	isbn = {0-553-34082-4 978-0-553-34082-2},
	publisher = {Bantam Books},
	author = {Prigogine, Ilya and Stengers, Isabelle},
	year = {1984},
	file = {Prigogine.Stengers.1984.OrderOutOfChaos.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Prigogine.Stengers.1984.OrderOutOfChaos.pdf:application/pdf}
}

@book{maturana_autopoiesis_1980,
	address = {Dordrecht},
	title = {Autopoiesis and {Cognition}: {The} {Realization} of the {Living}},
	isbn = {978-90-277-1016-1},
	shorttitle = {Autopoiesis and {Cognition}},
	abstract = {This is a bold, brilliant, provocative and puzzling work. It demands a radical shift in standpoint, an almost paradoxical posture in which living systems are described in terms of what lies outside the domain of descriptions. Professor Humberto Maturana, with his colleague Francisco Varela, have undertaken the construction of a systematic theoretical biology which attempts to define living systems not as they are objects of observation and description, nor even as in teracting systems, but as self-contained unities whose only reference is to them selves. Thus, the standpoint of description of such unities from the 'outside', i. e. , by an observer, already seems to violate the fundamental requirement which Maturana and Varela posit for the characterization of such system- namely, that they are autonomous, self-referring and self-constructing closed systems - in short, autopoietic systems in their terms. Yet, on the basis of such a conceptual method, and such a theory of living systems, Maturana goes on to define cognition as a biological phenomenon; as, in effect, the very nature of all living systems. And on this basis, to generate the very domains of interac tion among such systems which constitute language, description and thinking.},
	language = {en},
	publisher = {D. Reidel Publishing Company},
	author = {Maturana, H. R. and Varela, Francisco J.},
	month = jan,
	year = {1980},
	file = {Maturana.1928.AutopoiesisAndAognition.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Maturana.1928.AutopoiesisAndAognition.pdf:application/pdf}
}

@incollection{legg_collection_2007,
	address = {Amsterdam},
	series = {Frontiers in {Artificial} {Intelligence} and applications},
	title = {A collection of definitions of intelligence},
	volume = {157},
	booktitle = {Advances in artificial general intelligence: {Concepts}, archtectures and algorithms},
	publisher = {IOS Press},
	author = {Legg, Shane and Hutter, Marcus},
	editor = {Goertzel, Ben and Wang, Pei},
	year = {2007},
	pages = {17--24}
}

@book{edelman_neural_1987,
	address = {New York},
	title = {Neural {Darwinism}: the theory of neuronal group selection},
	isbn = {978-0-465-04934-9},
	shorttitle = {Neural {Darwinism}},
	abstract = {Already the subject of considerable pre-publication discussion, this magisterial work by one of the nation’s leading neuroscientists presents a radically new view of the function of the brain and nervous system. Its central idea is that the nervous system in each individual operates as a selective system resembling natural selection in evolution, but operating by different mechanisms. By providing a fundamental neural basis for categorization of the things of this world it unifies perception, action, and learning. The theory also completely revises our view of memory, which it considers to be a dynamic process of recategorization rather than a replicative store of attributes. This has deep implications for the interpretation of various psychological states from attention to dreaming.Neural Darwinism ranges over many disciplines, focusing on key problems in developmental and evolutionary biology, anatomy, physiology, ethology, and psychology. This book should therefore prove indispensable to advanced undergraduate and graduate students in these fields, to students of medicine, and to those in the social sciences concerned with the relation of behavior to biology. Beyond that, this far-ranging theory of brain function is bound to stimulate renewed discussions of such philosophical issues as the mind-body problem, the origins of knowledge, and the perceptual basis of language.},
	language = {en},
	publisher = {Basic Books},
	author = {Edelman, Gerald M.},
	year = {1987}
}

@book{deleuze_thousand_1987,
	address = {Minneapolis},
	title = {A {Thousand} {Plateaus}: {Capitalism} and {Schizophrenia}},
	isbn = {978-0-8166-1402-8},
	shorttitle = {A {Thousand} {Plateaus}},
	abstract = {Suggests an open system of psychological exploration to cut through accepted norms of morality, language, and politics},
	language = {en},
	publisher = {University of Minnesota Press},
	author = {Deleuze, Gilles and Guattari, Félix},
	year = {1987},
	file = {DeleuzeGuattari.1987.AThousandPlateausCapitalismAndSchizophrenia.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/DeleuzeGuattari.1987.AThousandPlateausCapitalismAndSchizophrenia.pdf:application/pdf}
}

@book{delanda_new_2006,
	address = {London \& New York},
	title = {A {New} {Philosophy} of {Society}: {Assemblage} {Theory} and {Social} {Complexity}},
	isbn = {978-1-4411-1448-8},
	shorttitle = {A {New} {Philosophy} of {Society}},
	abstract = {Manuel DeLanda is a distinguished writer, artist and philosopher. In his new book, he offers a fascinating look at how the contemporary world is characterized by an extraordinary social complexity. Since most social entities, from small communities to large nation-states, would disappear altogether if human minds ceased to exist, Delanda proposes a novel approach to social ontology that asserts the autonomy of social entities from the conceptions we have of them.},
	language = {en},
	publisher = {A\&C Black},
	author = {DeLanda, Manuel},
	month = sep,
	year = {2006},
	keywords = {vveitas:social\_cognition},
	file = {DeLanda.2006.ANewPhilosophyOfSocietyAssemblageTheoryAndSocialComplexity.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/DeLanda.2006.ANewPhilosophyOfSocietyAssemblageTheoryAndSocialComplexity.pdf:application/pdf}
}

@article{cushing_towards_2015,
	title = {Towards a data processing plane: {An} automata-based distributed dynamic data processing model},
	issn = {0167-739X},
	shorttitle = {Towards a data processing plane},
	url = {http://www.sciencedirect.com/science/article/pii/S0167739X15003647},
	doi = {10.1016/j.future.2015.11.016},
	abstract = {Data processing complexity, partitionability, locality and provenance play a crucial role in the effectiveness of distributed data processing. Dynamics in data processing necessitates effective modeling which allows the understanding and reasoning of the fluidity of data processing. Through virtualization, resources have become scattered, heterogeneous, and dynamic in performance and networking. In this paper, we propose a new distributed data processing model based on automata where data processing is modeled as state transformations. This approach falls within a category of declarative concurrent paradigms which are fundamentally different than imperative approaches in that communication and function order are not explicitly modeled. This allows an abstraction of concurrency and thus suited for distributed systems. Automata gives us a way to formally describe data processing independent from underlying processes while also providing routing information to route data based on its current state in a P2P fashion around networks of distributed processing nodes. Through an implementation, named Pumpkin, of the model we capture the automata schema and routing table into a data processing protocol and show how globally distributed resources can be brought together in a collaborative way to form a processing plane where data objects are self-routable on the plane.},
	urldate = {2016-01-17},
	journal = {Future Generation Computer Systems},
	author = {Cushing, Reginald and Belloum, Adam and Bubak, Marian and de Laat, Cees},
	year = {2015},
	keywords = {vveitas:distributed\_systems},
	file = {Cushing.EtAl.2015.TowardsADAtaProcessingPlaneAnAutomataBasedDistributedDataProcessingModel.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Cushing.EtAl.2015.TowardsADAtaProcessingPlaneAnAutomataBasedDistributedDataProcessingModel.pdf:application/pdf}
}

@unpublished{goertzel_matching_2015,
	title = {Matching {Algorithm} {For} {Attention} {Offer} {Networks}},
	language = {English},
	author = {Goertzel, Ben},
	year = {2015},
	note = {v3},
	keywords = {vveitas:offer\_networks}
}

@book{pinker_better_2012,
	edition = {Reprint},
	title = {The {Better} {Angels} of {Our} {Nature}: {Why} {Violence} {Has} {Declined}},
	isbn = {0-14-312201-0 978-0-14-312201-2},
	publisher = {Penguin Books},
	author = {Pinker, Steven},
	year = {2012}
}

@book{badiou_communist_2010,
	edition = {First edition in English.},
	title = {The {Communist} {Hypothesis}},
	isbn = {1-84467-600-5 978-1-84467-600-2 1-78168-870-2 978-1-78168-870-0},
	publisher = {Verso},
	author = {Badiou, Alain},
	year = {2010}
}

@book{prakken_logical_2013,
	title = {Logical {Tools} for {Modelling} {Legal} {Argument}: {A} {Study} of {Defeasible} {Reasoning} in {Law}},
	isbn = {978-94-015-8975-8},
	shorttitle = {Logical {Tools} for {Modelling} {Legal} {Argument}},
	abstract = {This book is a revised and extended version of my PhD Thesis 'Logical Tools for Modelling Legal Argument', which I defended on 14 January 1993 at the Free University Amsterdam. The first five chapters of the thesis have remained almost completely unchanged but the other chapters have undergone considerable revision and expansion. Most importantly, I have replaced the formal argument-based system of the old Chapters 6, 7 and 8 with a revised and extended system, whieh I have developed during the last three years in collaboration with Giovanni Sartor. Apart from some technical improvements, the main additions to the old system are the enriehment of its language with a nonprovability operator, and the ability to formalise reasoning about preference criteria. Moreover, the new system has a very intuitive dialectieal form, as opposed to the rather unintuitive fixed-point appearance of the old system. Another important revision is the split of the old Chapter 9 into two new chapters. The old Section 9. 1 on related research has been updated and expanded into a whole chapter, while the rest of the old chapter is now in revised form in Chapter 10. This chapter also contains two new contributions, a detailed discussion of Gordon's Pleadings Game, and a general description of a multi-Iayered overall view on the structure of argu mentation, comprising a logieal, dialectical, procedural and strategie layer. Finally, in the revised conclusion I have paid more attention to the relevance of my investigations for legal philosophy and argumentation theory.},
	language = {en},
	publisher = {Springer Science \& Business Media},
	author = {Prakken, Henry},
	month = apr,
	year = {2013}
}

@techreport{u.s._department_of_state_enduring_2015,
	title = {Enduring {Leadership} in {A} {Dynamic} {World}},
	url = {www.usaid.gov/sites/default/files/documents/1870/QDDR2015.pdf},
	language = {English},
	urldate = {2015-05-10},
	author = {\{U.S. Department of State\} and \{U.S. Agency for International Development\}},
	year = {2015},
	pages = {90},
	file = {USG.2015.EnduringLeadershipInADynamicWorld.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/USG.2015.EnduringLeadershipInADynamicWorld.pdf:application/pdf}
}

@article{hidalgo_information-based_2014,
	title = {Information-based fitness and the emergence of criticality in living systems},
	volume = {111},
	doi = {10.1073/pnas.1319166111},
	journal = {Proceedings of the National Academy of Science},
	author = {Hidalgo, J. and Grilli, J. and Suweis, S. and Munoz, M. A. and Banavar, J. R. and Maritan, A.},
	month = jul,
	year = {2014},
	pages = {10095--10100}
}

@article{millhiser_teaching_2012,
	title = {Teaching critical chain project management: the academic debate and illustrative examples},
	volume = {12},
	number = {2},
	journal = {INFORMS Transactions on Education},
	author = {Millhiser, William P and Szmerekovsky, Joseph G},
	year = {2012},
	keywords = {vveitas:business\_management},
	pages = {67--77}
}

@book{leach_critical_2004,
	edition = {2},
	title = {Critical {Chain} {Project} {Management}, {Second} {Edition}},
	isbn = {1-58053-903-3 978-1-58053-903-6},
	publisher = {Artech House Publishers},
	author = {Leach, Lawrence P.},
	year = {2004},
	keywords = {vveitas:business\_management}
}

@book{kurt_demaagd_practical_2012,
	edition = {1},
	title = {Practical {Computer} {Vision} with {SimpleCV}: {The} {Simple} {Way} to {Make} {Technology} {See}},
	isbn = {1-4493-2036-8 978-1-4493-2036-2},
	publisher = {O'Reilly Media},
	author = {Kurt Demaagd, Anthony Oliver, Nathan Oostendorp, Katherine Scott},
	year = {2012},
	keywords = {vveitas:computer\_vision}
}

@article{quax_stripping_2016,
	title = {Stripping syntax from complexity: {An} information-theoretical perspective on complex systems},
	journal = {ArXiv e-prints},
	author = {Quax, R. and Har-Shemesh, O. and Thurner, S. and Sloot, P. M. A.},
	month = mar,
	year = {2016}
}

@book{kelton_simulation_nodate,
	edition = {3},
	title = {Simulation {Modeling} and {Analysis}},
	publisher = {McGraw-Hill},
	author = {Kelton, David W. and Law, Averill M.}
}

@book{patton_user_2014,
	edition = {1},
	title = {User {Story} {Mapping}: {Discover} the {Whole} {Story}, {Build} the {Right} {Product}},
	isbn = {1-4919-0490-9 978-1-4919-0490-9},
	publisher = {O'Reilly Media},
	author = {Patton, Jeff and Economy, Peter},
	year = {2014}
}

@book{smolin_time_2013,
	title = {Time reborn: {From} the crisis in physics to the future of the universe},
	isbn = {978-0-547-51172-6},
	url = {http://gen.lib.rus.ec/book/index.php?md5=6f3d0eeeadfc450d1ae3bde9c996bf07},
	publisher = {Houghton Mifflin Harcourt},
	author = {Smolin, Lee},
	year = {2013},
	keywords = {vveitas:individuation\_in\_physics}
}

@unpublished{barbour_nature_2008,
	title = {The {Nature} of {Time}},
	url = {http://www.platonia.com/nature_of_time_essay.pdf},
	language = {English},
	author = {Barbour, Julian},
	month = dec,
	year = {2008},
	keywords = {vveitas:individuation\_in\_physics}
}

@article{barbour_identification_2014,
	title = {Identification of a {Gravitational} {Arrow} of {Time}},
	volume = {113},
	url = {http://link.aps.org/doi/10.1103/PhysRevLett.113.181101},
	doi = {10.1103/PhysRevLett.113.181101},
	abstract = {It is widely believed that special initial conditions must be imposed on any time-symmetric law if its solutions are to exhibit behavior of any kind that defines an “arrow of time.” We show that this is not so. The simplest nontrivial time-symmetric law that can be used to model a dynamically closed universe is the Newtonian N-body problem with vanishing total energy and angular momentum. Because of special properties of this system (likely to be shared by any law of the Universe), its typical solutions all divide at a uniquely defined point into two halves. In each, a well-defined measure of shape complexity fluctuates but grows irreversibly between rising bounds from that point. Structures that store dynamical information are created as the complexity grows and act as “records.” Each solution can be viewed as having a single past and two distinct futures emerging from it. Any internal observer must be in one half of the solution and will only be aware of the records of one branch and deduce a unique past and future direction from inspection of the available records.},
	number = {18},
	urldate = {2016-03-28},
	journal = {Physical Review Letters},
	author = {Barbour, Julian and Koslowski, Tim and Mercati, Flavio},
	month = oct,
	year = {2014},
	keywords = {vveitas:individuation\_in\_physics},
	pages = {181101}
}

@unpublished{weinbaum_spooky_2016,
	type = {Working paper},
	title = {Spooky {Action} at {No} {Distance}, 2016-03-08 revision},
	url = {https://www.academia.edu/23096540/Spooky_Action_at_No_Distance},
	abstract = {Recent experiments have perfectly verified the fact that quantum correlations between two entangled particles are stronger than any classical, local pre-quantum worldview allows. This is famously called the EPR paradox ﬁrst conceived as a thought},
	language = {English},
	urldate = {2016-03-28},
	author = {Weinbaum, David R.},
	year = {2016},
	keywords = {vveitas:individuation\_in\_physics}
}

@unpublished{lisalab_deep_2015,
	address = {University of Montreal},
	type = {Tutorial},
	title = {Deep {Learning} {Tutorial}},
	url = {https://www.google.be/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwjFzJW-qNXLAhULcBoKHUGqDRMQFggbMAA&url=http%3A%2F%2Fdeeplearning.net%2Ftutorial%2Fdeeplearning.pdf&usg=AFQjCNHkjfcIhjBA1-R86wuTRI-q5bwJDw&sig2=FTwxxuha5y3CRNKC4hW-YQ},
	language = {English},
	urldate = {2016-03-22},
	author = {LISAlab},
	year = {2015},
	note = {Revision 1.0}
}

@book{william_bechtel_discovering_2010,
	edition = {Reissue},
	title = {Discovering {Complexity}: {Decomposition} and {Localization} as {Strategies} in {Scientific} {Research}},
	isbn = {0-262-51473-7 978-0-262-51473-6},
	url = {http://gen.lib.rus.ec/book/index.php?md5=8290A7B241E528B591B0F3AF5013C658},
	publisher = {The MIT Press},
	author = {William Bechtel, Robert C. Richardson},
	year = {2010}
}

@article{barandiaran_complexity_2003,
	title = {Complexity and evolutionary simulation models in cognitive science {Epistemology} of synthetic bottom-up simulation modelling},
	author = {Barandiaran, Xabier},
	year = {2003},
	keywords = {vveitas:generative\_model, vveitas:cognitive\_development, vveitas:plast}
}

@book{yin_case_2002,
	edition = {3rd},
	series = {Third {Edition}, {Applied} {Social} {Research} {Methods} {Series}},
	title = {Case {Study} {Research}: {Design} and {Methods}},
	volume = {5},
	isbn = {0-7619-2553-8 978-0-7619-2553-8},
	author = {Yin, Robert K.},
	year = {2002}
}

@article{crumley_heterarchy_1995,
	title = {Heterarchy and the {Analysis} of {Complex} {Societies}},
	volume = {6},
	issn = {1551-8248},
	url = {http://onlinelibrary.wiley.com/doi/10.1525/ap3a.1995.6.1.1/abstract},
	doi = {10.1525/ap3a.1995.6.1.1},
	abstract = {Archeologists' dissatisfaction with Service's band-tribe-chiefdom-state model of sociocultural complexity has resulted in the epistemological reexamination of hierarchy, the exploration of heterarchy, and the historical and contextual flux between them. This calculus of power relations within and between polities aids understanding of how power shifts occur and under what conditions various power distributions constitute stable and unstable configurations. Power relations, while predicated on systems of values, leave physical evidence when their importance is ranked and reranked by individuals, groups, and organizations as conditions change. The hierarchy-heterarchy relation offers a new approach to the study of agency, conflict, and cooperation.},
	language = {en},
	number = {1},
	urldate = {2014-02-22},
	journal = {Archeological Papers of the American Anthropological Association},
	author = {Crumley, Carole L.},
	year = {1995},
	pages = {1--5},
	file = {Crumley.1995.HeterarchyAndAnalysisOfComplexSystems.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Crumley.1995.HeterarchyAndAnalysisOfComplexSystems.pdf:application/pdf}
}

@misc{goertzel_mindplexes_2003,
	type = {Blog},
	title = {Mindplexes},
	url = {http://www.goertzel.org/dynapsyc/2003/mindplex.htm},
	language = {English},
	urldate = {2014-02-11},
	journal = {Dynamic Psychology},
	author = {Goertzel, Ben},
	year = {2003},
	file = {Goertzel.2003.Mindplexes.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Goertzel.2003.Mindplexes.pdf:application/pdf}
}

@article{stumbrys_induction_2012,
	title = {Induction of lucid dreams: {A} systematic review of evidence},
	volume = {21},
	issn = {10538100},
	shorttitle = {Induction of lucid dreams},
	url = {http://www.frontiersin.org/profile/publications/23268641},
	doi = {10.1016/j.concog.2012.07.003},
	number = {3},
	urldate = {2014-02-09},
	journal = {Consciousness and Cognition},
	author = {Stumbrys, Tadas and Erlacher, Daniel and Schädlich, Melanie and Schredl, Michael},
	month = sep,
	year = {2012},
	pages = {1456--1475},
	file = {Stumbrys.EtAl.2012.InductionOfLucidDreamsASystematicReviewOfEvidence.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Stumbrys.EtAl.2012.InductionOfLucidDreamsASystematicReviewOfEvidence.pdf:application/pdf}
}

@book{nguyen_computational_2009,
	title = {Computational {Collective} {Intelligence}. {Semantic} {Web}, {Social} {Networks} and {Multiagent} {Systems}: {First} {International} {Conference}, {ICCCI} 2009, {Wroclaw}, {Poland}, {October} 5-7, 2009, {Proceedings}},
	isbn = {978-3-642-04440-3},
	shorttitle = {Computational {Collective} {Intelligence}. {Semantic} {Web}, {Social} {Networks} and {Multiagent} {Systems}},
	abstract = {Today s mobile robot perception is insufficient for acting goal-directedly in unconstrained, dynamic everyday environments like a home, a factory, or a city. Subject to restrictions in bandwidth, computer power, and computation time, a robot has to react to a wealth of dynamically changing stimuli in such environments, requiring rapid, selective attention to decisive, action-relevant information of high current utility. Robust and general engineering methods for effectively and efficiently coupling perception, action and reasoning are unavailable. Interesting performance, if any, is currently only achieved by sophisticated robot programming exploiting domain features and specialties, which leaves ordinary users no chance of changing how the robot acts. The purpose of this volume - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in June 2006 - is to give a first overview on the concept of affordances for the design and implementation of autonomous mobile robots acting goal-directedly in a dynamic environment. The aim is to develop affordance-based control as a method for robotics. The potential of this new methodology will be shown by going beyond navigation-like tasks towards goaldirected autonomous manipulation in the project demonstrators.},
	language = {en},
	publisher = {Springer},
	author = {Nguyen, Ngoc Thanh and Kowalczyk, Ryszard and Chen, Shyi-Ming},
	month = sep,
	year = {2009},
	file = {Nguyen.Kowalczyk.Chen(Eds.).2009.ComputationalCollectiveIntelligenceSemanticWebSocialNetworksAndMultiagentSystems.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Nguyen.Kowalczyk.Chen(Eds.).2009.ComputationalCollectiveIntelligenceSemanticWebSocialNetworksAndMultiagentSystems.pdf:application/pdf}
}

@article{minsky_theory_1977,
	title = {A {Theory} of {Systemic} {Fragility}},
	url = {http://digitalcommons.bard.edu/hm_archive/231},
	journal = {Financial Crises: Institutions and Markets in a Fragile Environment},
	author = {Minsky, Hyman},
	month = jan,
	year = {1977}
}

@misc{veitas_challprop_2013,
	address = {Brussels},
	type = {{ECCO}/{GBI} seminar},
	title = {{ChallProp} : an agent-based modelling framework for simulating the {Global} {Brain}},
	url = {http://ecco.vub.ac.be/?q=node/219},
	language = {English},
	author = {Veitas, Viktoras},
	month = nov,
	year = {2013},
	keywords = {vveitas:challprop\_roadmap}
}

@inproceedings{tatnall_actor-network_1999,
	title = {Actor-{Network} {Theory} and {Information} {Systems} {Research}},
	abstract = {In this paper, the authors will advocate the addition of actor-network theory to the qualitative research traditions presently used in information systems. We will contend that actor-network theory can be especially useful when studying the implementation of information systems and in other situations involving technological innovation. The paper describes actor-network theory, an approach originating in studies of science and technology, and how it might be  used in studying technological projects. It also offers the theory of innovation translation, informed by actor-network theory, as an alternative to innovation diffusion in understanding issues of information systems implementation.},
	booktitle = {Proc. 10th {Australian} {Conference} on {Information} {Systems}},
	publisher = {McGraw-Hill},
	author = {Tatnall, Arthur and Gilding, Anthony},
	year = {1999},
	pages = {955--966},
	file = {Tatnall.Gilding.1999.Actor-NetworkTheoryAndInformationSystemsResearch.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Tatnall.Gilding.1999.Actor-NetworkTheoryAndInformationSystemsResearch.pdf:application/pdf}
}

@book{stadtfeld_events_2012,
	title = {Events in social networks : a stochastic actor-oriented framework for dynamic event processes in social networks},
	isbn = {978-3-86644-792-9},
	shorttitle = {Events in social networks},
	language = {en},
	publisher = {KIT Scientific Publishing},
	author = {Stadtfeld, Christoph},
	year = {2012},
	keywords = {vveitas:challprop\_roadmap},
	file = {Stadfield.2012.EventsInSocialNetworks.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Stadfield.2012.EventsInSocialNetworks.pdf:application/pdf}
}

@book{metzinger_ego_2009,
	title = {The {Ego} {Tunnel}: {The} {Science} of the {Mind} and the {Myth} of the {Self}},
	isbn = {0-7867-4442-1},
	shorttitle = {The {Ego} {Tunnel}},
	abstract = {We're used to thinking about the self as an independent entity, something that we either have or are. In "The Ego Tunnel," philosopher Thomas Metzinger claims otherwise: No such thing as a "self" exists. The conscious self is the content of a model create},
	language = {en},
	publisher = {Basic Books},
	author = {Metzinger, Thomas},
	year = {2009},
	file = {Metzinger.2009.TheEgoTunnelTheScienceOfTheMindAndTheMythOfTheSelf.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Metzinger.2009.TheEgoTunnelTheScienceOfTheMindAndTheMythOfTheSelf.pdf:application/pdf}
}

@book{miller_complex_2009,
	title = {Complex {Adaptive} {Systems}: {An} {Introduction} to {Computational} {Models} of {Social} {Life}: {An} {Introduction} to {Computational} {Models} of {Social} {Life}},
	isbn = {1-4008-3552-6},
	shorttitle = {Complex {Adaptive} {Systems}},
	abstract = {This book provides the first clear, comprehensive, and accessible account of complex adaptive social systems, by two of the field's leading authorities. Such systems--whether political parties, stock markets, or ant colonies--present some of the most intriguing theoretical and practical challenges confronting the social sciences. Engagingly written, and balancing technical detail with intuitive explanations, Complex Adaptive Systems focuses on the key tools and ideas that have emerged in the field since the mid-1990s, as well as the techniques needed to investigate such systems. It provides a detailed introduction to concepts such as emergence, self-organized criticality, automata, networks, diversity, adaptation, and feedback. It also demonstrates how complex adaptive systems can be explored using methods ranging from mathematics to computational models of adaptive agents.  John Miller and Scott Page show how to combine ideas from economics, political science, biology, physics, and computer science to illuminate topics in organization, adaptation, decentralization, and robustness. They also demonstrate how the usual extremes used in modeling can be fruitfully transcended.},
	language = {en},
	publisher = {Princeton University Press},
	author = {Miller, John H. and Page, Scott E.},
	month = nov,
	year = {2009},
	file = {Miller.Page.2007.ComplexAdaptiveSystemsAnIntroductionToComputationalModelsOfSocialLife.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Miller.Page.2007.ComplexAdaptiveSystemsAnIntroductionToComputationalModelsOfSocialLife.pdf:application/pdf}
}

@book{latour_reassembling_2007,
	title = {Reassembling the {Social}: {An} {Introduction} to {Actor}-{Network}-{Theory}},
	isbn = {978-0-19-925605-1},
	shorttitle = {Reassembling the {Social}},
	abstract = {Reassembling the Social is a fundamental challenge from one of the world's leading social theorists to how we understand society and the 'social'. Bruno Latour's contention is that the word 'social', as used by Social Scientists, has become laden with assumptions to the point where it has become misnomer. When the adjective is applied to a phenomenon, it is used to indicate a stablilized state of affairs, a bundle of ties that in due course may be used to account for another phenomenon. But Latour also finds the word used as if it described a type of material, in a comparable way to an adjective such as 'wooden' or 'steely'. Rather than simply indicating what is already assembled together, it is now used in a way that makes assumptions about the nature of what is assembled. It has become a word that designates two distinct things: a process of assembling; and a type of material, distinct from others. Latour shows why 'the social' cannot be thought of as a kind of material or domain, and disputes attempts to provide a 'social explanations' of other states of affairs. While these attempts have been productive (and probably necessary) in the past, the very success of the social sciences mean that they are largely no longer so. At the present stage it is no longer possible to inspect the precise constituents entering the social domain. Latour returns to the original meaning of 'the social' to redefine the notion, and allow it to trace connections again. It will then be possible to resume the traditional goal of the social sciences, but using more refined tools. Drawing on his extensive work examining the 'assemblages' of nature, Latour finds it necessary to scrutinize thoroughly the exact content of what is assembled under the umbrella of Society. This approach, a 'sociology of associations', has become known as Actor-Network-Theory, and this book is an essential introduction both for those seeking to understand Actor-Network Theory, or the ideas of one of its most influential proponents.},
	language = {en},
	publisher = {OUP Oxford},
	author = {Latour, Bruno},
	month = sep,
	year = {2007}
}

@article{fontana_what_1994,
	title = {What would be conserved if "the tape were played twice"?},
	volume = {91},
	issn = {0027-8424, 1091-6490},
	url = {http://www.pnas.org/content/91/2/757},
	doi = {10.1073/pnas.91.2.757},
	abstract = {We develop an abstract chemistry, implemented in a lambda-calculus-based modeling platform, and argue that the following features are generic to this particular abstraction of chemistry; hence, they would be expected to reappear if "the tape were run twice": (i) hypercycles of self-reproducing objects arise; (ii) if self-replication is inhibited, self-maintaining organizations arise; and (iii) self-maintaining organizations, once established, can combine into higher-order self-maintaining organizations.},
	language = {en},
	number = {2},
	urldate = {2013-12-17},
	journal = {Proceedings of the National Academy of Sciences},
	author = {Fontana, W. and Buss, L. W.},
	month = jan,
	year = {1994},
	pmid = {8290596},
	pages = {757--761},
	file = {Fontana.Buss.1993.WhatWouldBeConserverIfTheTapeWerePlayedTwice.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Fontana.Buss.1993.WhatWouldBeConserverIfTheTapeWerePlayedTwice.pdf:application/pdf}
}

@article{fontana_arrival_1994,
	title = {“{The} arrival of the fittest”: {Toward} a theory of biological organization},
	volume = {56},
	issn = {0092-8240, 1522-9602},
	shorttitle = {“{The} arrival of the fittest”},
	url = {http://link.springer.com/article/10.1007/BF02458289},
	doi = {10.1007/BF02458289},
	abstract = {The formal structure of evolutionary theory is based upon the dynamics of alleles, individuals and populations. As such, the theory must assume the prior existence of these entities. This existence problem was recognized nearly a century ago, when DeVries (1904,Species and Varieties: Their Origin by Mutation) stated. “Natural selection may explain the survival of the fittest, but it cannot explain the arrival of the fittest.” At the heart of the existence problem is determining how biological organizations arise in ontogeny and in phylogeny. We develop a minimal theory of biological organization based on two abstractions from chemistry. The theory is formulated using λ-calculus, which provides a natural framework capturing (i) the constructive feature of chemistry, that the collision of molecules generates specific new molecules, and (ii) chemistry's diversity of equivalence classes, that many different reactants can yield the same stable product. We employ a well-stirred and constrained stochastic flow reactor to explore the generic behavior of large numbers of applicatively interacting λ-expressions. This constructive dynamical system generates fixed systems of transformation characterized by syntactical and functional invariances. Organizations are recognized and defined by these syntactical and functional regularities. Objects retained within an organization realize and algebraic structure and possess a grammar which is invariant under the interaction between objects. An organization is self-maintaining, and is characterized by (i) boundaries established by the invariances, (ii) strong self-repair capabilities responsible for a robustness to perturbation, and (iii) a center, defined as the smallest kinetically persistent and self-maintaining generator set of the algebra. Imposition of different boundary conditions on the stochastic flow reactor generates different levels of organization, and a diversity of organizations within each level. Level 0 is defined by selfcopying objects or simple ensembles of copying objects. Level 1 denotes a new object class, whose objects are self-maintaining organizations made of Level 0 objects, and Level 2 is defined by self-maintaining metaorganizations composed of Level 1 organizations. These results invite analogy to the history of life, that is, to the progression from self-replication to self-maintaining procaryotic organizations to ultimately yield self-maintaining eucaryotic organizations. In our system self-maintaining organizations arise as a generic consequence of two features of chemistry, without appeal to natural selection. We hold these findings as calling for increased attention to the structural basis of biological order.},
	language = {en},
	number = {1},
	urldate = {2013-12-17},
	journal = {Bulletin of Mathematical Biology},
	author = {Fontana, Walter and Buss, Leo W.},
	month = jan,
	year = {1994},
	pages = {1--64},
	file = {Fontana.Buss.1994.TheArrivalOfTheFittestTowardATheoryOfBiologicalOrganization.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Fontana.Buss.1994.TheArrivalOfTheFittestTowardATheoryOfBiologicalOrganization.pdf:application/pdf}
}

@techreport{fontana_barrier_1996,
	type = {Working {Paper}},
	title = {The {Barrier} of {Objects}: {From} {Dynamical} {Systems} to {Bounded} {Organizations}},
	shorttitle = {The {Barrier} of {Objects}},
	url = {http://ideas.repec.org/p/wop/iasawp/wp96027.html},
	abstract = {No abstract is available for this item.},
	number = {wp96027},
	urldate = {2013-12-17},
	institution = {International Institute for Applied Systems Analysis},
	author = {Fontana, W. and Buss, L. W.},
	year = {1996},
	file = {Fontana.Buss.1996.TheBarrierOfObjectsFromDynamicslSystemsToBuondedOrganizations.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Fontana.Buss.1996.TheBarrierOfObjectsFromDynamicslSystemsToBuondedOrganizations.pdf:application/pdf}
}

@unpublished{vereecke_cybernetics_2009,
	address = {Leuven, Belgium},
	type = {Course notes},
	title = {Cybernetics},
	shorttitle = {Cybernetics},
	language = {English},
	author = {Vereecke, Johan},
	year = {2009},
	note = {Course notes of the course Cybernetics and its Applications in Physiology and Biological Sciences, tought in KU Leuven, Belgium in 2009.},
	file = {Vereecke.2009.Cybernetics.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Vereecke.2009.Cybernetics.pdf:application/pdf}
}

@inproceedings{veloz_decomposition_2011,
	address = {Paris},
	title = {A decomposition theorem in chemical organizations},
	booktitle = {Proc. of {European} {Conference} on {Artificial} {Life} ({ECAL} 2011)},
	publisher = {Springer},
	author = {Veloz, Tomas and Reynaert, Bryan and Rojas, David and Dittrich, Peter},
	year = {2011},
	file = {Veloz.EtAl.ADecompositionTheoremInChemicalOrganizations.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Veloz.EtAl.ADecompositionTheoremInChemicalOrganizations.pdf:application/pdf}
}

@misc{glover_java_2010,
	type = {{CT}316},
	title = {Java development 2.0: {Introducing} {Kilim}},
	copyright = {© Copyright IBM Corporation 2010},
	shorttitle = {Java development 2.0},
	url = {http://www.ibm.com/developerworks/java/library/j-javadev2-7/},
	language = {en},
	urldate = {2013-12-11},
	author = {Glover, Andrew},
	month = apr,
	year = {2010},
	file = {Glover.2010.JavaDevelopment2.0IntroducingKilim.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Glover.2010.JavaDevelopment2.0IntroducingKilim.pdf:application/pdf}
}

@inproceedings{srinivasan_thread_2006,
	title = {A {Thread} of {One}’s {Own}},
	abstract = {Abstract. This paper demonstrates an architecture for suspending and resuming methods in Java using a restricted form of continuation passing style (CPS) transformation. It describes Kilim 1, a toolkit to portably weave threads of control called Fibers, through Java code. The chief contributions of this paper are the set of design choices made for both space and time efficiency in getting one-shot continuations to work on the JVM (in some cases, 60x faster than competing approaches) and to address some tough issues traditionally passed over by others, such as handling of local subroutines and constructors. We are able to support hundreds of thousands of threads of control with switching times of the order of 3 to 4 μs on a low-powered laptop with Sun’s JVM.},
	author = {Srinivasan, Sriram},
	year = {2006},
	file = {Srinivasan.2006.AThreadOfOnesOwn.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Srinivasan.2006.AThreadOfOnesOwn.pdf:application/pdf}
}

@book{levy_collective_1997,
	address = {Cambridge, Mass.},
	title = {Collective intelligence: mankind's emerging world in cyberspace},
	isbn = {0-7382-0261-4 978-0-7382-0261-7},
	shorttitle = {Collective intelligence},
	language = {English},
	publisher = {Perseus Books},
	author = {Lévy, Pierre},
	year = {1997},
	keywords = {vveitas:distributed\_intelligence, vveitas:challprop\_roadmap},
	file = {Levy.1999.CollectiveIntelligence.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Levy.1999.CollectiveIntelligence.pdf:application/pdf}
}

@techreport{srinivasan_kilim:_2010,
	title = {Kilim: {A} server framework with lightweight actors, isolation types and zero-copy messaging},
	url = {http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-769.pdf},
	number = {UCAM-CL-TR-769},
	institution = {University of Cambridge, Computer Laboratory},
	author = {Srinivasan, Sriram},
	month = feb,
	year = {2010},
	file = {Srinivasan.2010.KilimAServerFameworkWithLightweightctorsIsolationTypesAndZeroCopyMessaging.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/Srinivasan.2010.KilimAServerFameworkWithLightweightctorsIsolationTypesAndZeroCopyMessaging.pdf:application/pdf}
}

@inproceedings{srinivasan_kilim:_2008,
	address = {Berlin, Heidelberg},
	series = {{ECOOP} '08},
	title = {Kilim: {Isolation}-{Typed} {Actors} for {Java}},
	isbn = {978-3-540-70591-8},
	shorttitle = {Kilim},
	url = {http://dx.doi.org/10.1007/978-3-540-70592-5_6},
	doi = {10.1007/978-3-540-70592-5_6},
	abstract = {This paper describes Kilim, a framework that employs a combination of techniques to help create robust, massively concurrent systems in mainstream languages such as Java: ({\textless}em{\textgreater}i{\textless}/em{\textgreater}) ultra-lightweight, cooperatively-scheduled threads ({\textless}em{\textgreater}actors{\textless}/em{\textgreater}), ({\textless}em{\textgreater}ii{\textless}/em{\textgreater}) a message-passing framework (no shared memory, no locks) and ({\textless}em{\textgreater}iii{\textless}/em{\textgreater}) isolation-aware messaging.Isolation is achieved by controlling the shape and ownership of mutable messages --- they must not have internal aliases and can only be owned by a single actor at a time. We demonstrate a static analysis built around isolation type qualifiers to enforce these constraints.Kilim comfortably scales to handle hundreds of thousands of actors and messages on modest hardware. It is fast as well --- task-switching is 1000x faster than Java threads and 60x faster than other lightweight tasking frameworks, and message-passing is 3x faster than Erlang (currently the gold standard for {\textless}em{\textgreater}concurrency-oriented{\textless}/em{\textgreater}programming).},
	urldate = {2013-12-08},
	booktitle = {Proceedings of the 22Nd {European} {Conference} on {Object}-{Oriented} {Programming}},
	publisher = {Springer-Verlag},
	author = {Srinivasan, Sriram and Mycroft, Alan},
	year = {2008},
	pages = {104--128},
	file = {SrinivasanMycroft.2008.KililmIsolationTypedActorsForJava.pdf:/media/vveitas/LibraryKing/vveitas@gmail.com/library/SrinivasanMycroft.2008.KililmIsolationTypedActorsForJava.pdf:application/pdf}
}

@article{attiya_sharing_1995,
	title = {Sharing {Memory} {Robustly} in {Message}-passing {Systems}},
	volume = {42},
	issn = {0004-5411},
	url = {http://doi.acm.org/10.1145/200836.200869},
	doi = {10.1145/200836.200869},
	abstract = {Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, single-writer multi-reader register in unreliable, asynchronous networks. The two message-passing models considered are a complete network with processor failures and an arbitrary network with dynamic link failures.These results make it possible to view the shared-memory model as a higher-level language for designing algorithms in asynchronous distributed systems. Any wait-free algorithm based on atomic, single-writer multi-reader registers can be automatically emulated in message-passing systems, provided that at least a majority of the processors are not faulty and remain connected. The overhead introduced by these emulations is polynomial in the number of processors in the system.Immediate new results are obtained by applying the emulators to known shared-memory algorithms. These include, among others, protocols to solve the following problems in the message-passing model in the presence of processor or link failures: multi-writer multi-reader registers, concurrent time-stamp systems, l-exclusion, atomic snapshots, randomized consensus, and implementation of data structures.},
	number = {1},
	urldate = {2013-12-07},
	journal = {J. ACM},
	author = {Attiya, Hagit and Bar-Noy, Amotz and Dolev, Danny},
	month = jan,
	year = {1995},
	pages = {124--142},
	file = {Attiya.EtAl.1995.SharingMemoryRobustlyInMessagePassingSystems.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Attiya.EtAl.1995.SharingMemoryRobustlyInMessagePassingSystems.pdf:application/pdf}
}

@article{lehman_evolvability_2013,
	title = {Evolvability {Is} {Inevitable}: {Increasing} {Evolvability} without the {Pressure} to {Adapt}},
	volume = {8},
	shorttitle = {Evolvability {Is} {Inevitable}},
	url = {http://dx.doi.org/10.1371/journal.pone.0062186},
	abstract = {Why evolvability appears to have increased over evolutionary time is an important unresolved biological question. Unlike most candidate explanations, this paper proposes that increasing evolvability can result without any pressure to adapt. The insight is that if evolvability is heritable, then an unbiased drifting process across genotypes can still create a distribution of phenotypes biased towards evolvability, because evolvable organisms diffuse more quickly through the space of possible phenotypes. Furthermore, because phenotypic divergence often correlates with founding niches, niche founders may on average be more evolvable, which through population growth provides a genotypic bias towards evolvability. Interestingly, the combination of these two mechanisms can lead to increasing evolvability without any pressure to out-compete other organisms, as demonstrated through experiments with a series of simulated models. Thus rather than from pressure to adapt, evolvability may inevitably result from any drift through genotypic space combined with evolution's passive tendency to accumulate niches.},
	number = {4},
	urldate = {2013-05-12},
	journal = {PLoS ONE},
	author = {Lehman, Joel and Stanley, Kenneth O.},
	month = apr,
	year = {2013},
	pages = {e62186},
	file = {Lehman.Stanley.2013.EvolvabilityIsInevitableIncreasingEvolvabilityWithoutThePressureToAdapt.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Lehman.Stanley.2013.EvolvabilityIsInevitableIncreasingEvolvabilityWithoutThePressureToAdapt.pdf:application/pdf}
}

@misc{rosnay_increase_2011,
	address = {Brussels},
	type = {Summary of presentation},
	title = {Increase of complexity of {Internet} interfaces and the {Darwinian}  process of selective stabilization of {Internet} nodes},
	url = {http://pespmc1.vub.ac.be/Conf/GB-0-abs.html},
	author = {Rosnay, Joël de},
	month = jul,
	year = {2011},
	file = {DeRosnay2001.IncreaseOfComplexityOfInternetInterfacesAndTheDarwinianProcessOfSelectiveStabilizationOfInternetNodes.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/DeRosnay2001.IncreaseOfComplexityOfInternetInterfacesAndTheDarwinianProcessOfSelectiveStabilizationOfInternetNodes.pdf:application/pdf}
}

@article{hofkirchner_unity_2003,
	title = {Unity {Through} {Diversity}. {Dialectics} - {Systems} {Thinking} - {Semiotics}},
	volume = {15},
	url = {http://www.inst.at/trans/15Nr/01_2/hofkirchner15.htm},
	urldate = {2013-12-06},
	journal = {TRANS: Internet journal for cultural sciences},
	author = {Hofkirchner, Wolfgang},
	year = {2003},
	file = {Hofkirchner.2003.UnityThroughDiversityDialecticsSystemsThinkingSemiotics.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Hofkirchner.2003.UnityThroughDiversityDialecticsSystemsThinkingSemiotics.pdf:application/pdf}
}

@inproceedings{matsumaru_organization-oriented_2006,
	address = {New York, NY, USA},
	series = {{BIONETICS} '06},
	title = {Organization-oriented {Chemical} {Programming} for the {Organic} {Design} of {Distributed} {Computing} {Systems}},
	isbn = {1-4244-0463-0},
	url = {http://doi.acm.org/10.1145/1315843.1315861},
	doi = {10.1145/1315843.1315861},
	abstract = {Biochemical information processing found in nature is known to be robust, self-organizing, adaptive, decentralized, asynchronous, fault-tolerant, and evolvable. A couple of approaches are already using the chemical metaphor, such as, Gamma, MGS, amorphous computing, membrane computing, and reaction-diffusion processors. However, in accordance with Conrad's tradeoff principle, programming a chemical computer appears to be difficult. Therefore, in order to further exploit the mentioned properties new programming techniques are required. Here we describe how chemical organization theory can serve as a tool for chemical programming. The theory allows to predict the potential behavior of a chemical program and thus supports a programmer in the design of a chemical-like control system. The approach is demonstrated by applying it to the maximal independent set problem. We show that the desired solutions are predicted by the theory as chemical organizations. Furthermore the theory uncovers "undesirable" organizations, representing uncompleted halting computations due to insufficient amount of molecules. Finally we discuss an architecture for a "chemical virtual machine".},
	urldate = {2013-12-04},
	booktitle = {Proceedings of the 1st {International} {Conference} on {Bio} {Inspired} {Models} of {Network}, {Information} and {Computing} {Systems}},
	publisher = {ACM},
	author = {Matsumaru, Naoki and Dittrich, Peter},
	year = {2006},
	file = {Matsumaru.Dittrich.2006.OrganizationOrientedChamicalProgrammingForTheOrganizDesignOfDistributedComputingSystems.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Matsumaru.Dittrich.2006.OrganizationOrientedChamicalProgrammingForTheOrganizDesignOfDistributedComputingSystems.pdf:application/pdf}
}

@incollection{hutter_universal_2007,
	series = {Cognitive {Technologies}},
	title = {Universal {Algorithmic} {Intelligence}: {A} {Mathematical} {Top}→{Down} {Approach}},
	copyright = {©2007 Springer-Verlag Berlin Heidelberg},
	isbn = {978-3-540-23733-4 978-3-540-68677-4},
	shorttitle = {Universal {Algorithmic} {Intelligence}},
	url = {http://link.springer.com/chapter/10.1007/978-3-540-68677-4_8},
	abstract = {Sequential decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff’s theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameter-free theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline how the AIXI model can formally solve a number of problem classes, including sequence prediction, strategic games, function minimization, reinforcement and supervised learning. The major drawback of the AIXI model is that it is un-computable. To overcome this problem, we construct a modified algorithm AIXItl that is still effectively more intelligent than any other time t and length l bounded agent. The computation time of AIXItl is of the order t·2l. The discussion includes formal definitions of intelligence order relations, the horizon problem and relations of the AIXI theory to other AI approaches.},
	urldate = {2013-12-04},
	booktitle = {Artificial {General} {Intelligence}},
	publisher = {Springer Berlin Heidelberg},
	author = {Hutter, Marcus},
	editor = {Goertzel, Ben and Pennachin, Cassio},
	month = jan,
	year = {2007},
	pages = {227--290},
	file = {Hutter.2003.UniversalAlgorithmicIntelligence.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Hutter.2003.UniversalAlgorithmicIntelligence.pdf:application/pdf}
}

@book{hutter_universal_2006,
	title = {Universal {Artificial} {Intelligence}: {Sequential} {Decisions} {Based} on {Algorithmic} {Probability}},
	isbn = {978-3-540-26877-2},
	shorttitle = {Universal {Artificial} {Intelligence}},
	abstract = {This book presents sequential decision theory from a novel algorithmic information theory perspective. While the former is suited for active agents in known environments, the latter is suited for passive prediction in unknown environments. The book introduces these two different ideas and removes the limitations by unifying them to one parameter-free theory of an optimal reinforcement learning agent embedded in an unknown environment. Most AI problems can easily be formulated within this theory, reducing the conceptual problems to pure computational ones. Considered problem classes include sequence prediction, strategic games, function minimization, reinforcement and supervised learning. The discussion includes formal definitions of intelligence order relations, the horizon problem and relations to other approaches. One intention of this book is to excite a broader AI audience about abstract algorithmic information theory concepts, and conversely to inform theorists about exciting applications to AI.},
	language = {en},
	publisher = {Springer},
	author = {Hutter, Marcus},
	month = jan,
	year = {2006},
	file = {Hutter.2004.UniversalArtificialIntelligenceSequentialDecisionsBasedOnAlgorithmicProbability.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Hutter.2004.UniversalArtificialIntelligenceSequentialDecisionsBasedOnAlgorithmicProbability.pdf:application/pdf}
}

@book{assche_evolutionary_2013,
	title = {Evolutionary {Governance} {Theory}: {An} {Introduction}},
	isbn = {978-3-319-00983-4},
	shorttitle = {Evolutionary {Governance} {Theory}},
	abstract = {?This short books offers the reader a remarkable new perspective on the way markets, laws and societies evolve together. It can be of use to anyone interested in development, market and public sector reform, public administration, politics \& law. Based on a wide variety of case studies on three continents and a variety of conceptual sources, the authors develop a theory that clarifies the nature and functioning of dependencies that mark governance evolutions. This in turn delineates in an entirely new manner the spaces open for policy experiment. As such, it offers a new mapping of the middle ground between libertarianism and social engineering. Theoretically, the approach draws on a wide array of sources: institutional \& development economics, systems theories, post-structuralism, actor- network theories, planning theory and legal studies.},
	language = {en},
	publisher = {Springer Verlag},
	author = {Assche, Kristof Van and Beunen, Raoul and Duineveld, Martijn},
	month = sep,
	year = {2013},
	file = {VanAssche.EtAl.2013.EvolutionaryGovernanceTheoryAnIntroduction.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/VanAssche.EtAl.2013.EvolutionaryGovernanceTheoryAnIntroduction.pdf:application/pdf}
}

@article{albert_error_2000,
	title = {Error and attack tolerance of complex networks},
	volume = {406},
	issn = {1476-4687},
	url = {http://www.ncbi.nlm.nih.gov/pubmed/10935628},
	doi = {10.1038/35019019},
	abstract = {Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network. Complex communication networks display a surprising degree of robustness: although key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. Here we demonstrate that error tolerance is not shared by all redundant systems: it is displayed only by a class of inhomogeneously wired networks, called scale-free networks, which include the World-Wide Web, the Internet, social networks and cells. We find that such networks display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates. However, error tolerance comes at a high price in that these networks are extremely vulnerable to attacks (that is, to the selection and removal of a few nodes that play a vital role in maintaining the network's connectivity). Such error tolerance and attack vulnerability are generic properties of communication networks.},
	number = {6794},
	urldate = {2012-03-26},
	journal = {Nature},
	author = {Albert and Jeong and Barabasi},
	month = jul,
	year = {2000},
	pmid = {10935628},
	pages = {378--382},
	file = {Albert.EtAl.2000.ErrorAndAttackToleranceOfComplexNetowrks.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Albert.EtAl.2000.ErrorAndAttackToleranceOfComplexNetowrks.pdf:application/pdf}
}

@article{hofkirchner_cognition_2005,
	title = {Cognition, {Communication}, and {Co}-operation in {Living} {Systems}. {Biosemiosis} in the {Context} of {Self}-organisation},
	volume = {3},
	copyright = {tripleC  is a peer-reviewed, open-access journal (ISSN: 1726-670X). All journal content, except where otherwise noted, is licensed under the  Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Austria License .},
	issn = {1726-670X},
	url = {http://www.triple-c.at/index.php/tripleC/article/view/23},
	abstract = {In the perspective of an as yet-to-be-developed Unified Theory of Information as part of an as yet-to-be-developed theory of evolutionary systems semiosis plausibly coincides with self-organisation. A concept of sign processes that is flexible enough to perform two functions as follows is everything that is required for this framework. It must relate to the most various manifestations of sign processes, thus enabling a variety of scientific disciplines to use a common concept where it seems appropriate; at the same time, it must be precise enough to fit the unique requirements of any individual branch of science dealing with a concrete manifestation. Different types of sign processes have to be related to, if not derived from (albeit in a nonformal way), different types of self-organisation. The paper illustrates how the relationship between the genus proximum of semiosis in self-organising systems and the differentia specifica of semiosis in biota may be approached.},
	language = {en},
	number = {2},
	urldate = {2013-12-02},
	journal = {tripleC: Communication, Capitalism \& Critique. Open Access Journal for a Global Sustainable Information Society},
	author = {Hofkirchner, Wolfgang and Ellersdorfer, Günther},
	year = {2005},
	pages = {75--85},
	file = {Hofkirchner.2013.CognitionCommunicationAndCooperationInLivingSystems.BiosemiosisInTheContextOfSelf-Organization.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Hofkirchner.2013.CognitionCommunicationAndCooperationInLivingSystems.BiosemiosisInTheContextOfSelf-Organization.pdf:application/pdf}
}

@article{hofkirchner_emergent_2012,
	title = {Emergent {Information}. {When} a {Difference} {Makes} a {Difference}…},
	volume = {11},
	copyright = {tripleC  is a peer-reviewed, open-access journal (ISSN: 1726-670X). All journal content, except where otherwise noted, is licensed under the  Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Austria License .},
	issn = {1726-670X},
	url = {http://triple-c.at/index.php/tripleC/article/view/330},
	abstract = {0   false       18 pt   18 pt   0   0     false   false   false                                     Gregory Bateson’s famous saying about information can be looked upon as a good foundation of a Unified Theory of Information (UTI). Section one discusses the hard and the soft science approaches to information. It will be argued that a UTI approach needs to overcome the divide between these approaches and can do so by adopting an historical and logical account of information. Section two gives a system theoretical sketch of such an information concept. It is based upon assuming a co-extension of self-organisation and information. Information is defined as a tripartite relation such that (1) Bateson’s “making a difference” is the build-up of the self-organised order; (2) Bateson’s “difference” that makes the difference is the perturbation that triggers the build-up; (3) Bateson’s difference that is made is made to the system because the perturbation serves a function for the system’s self-organisation. In semiotic terms, (1) a sign (= the self-organised order) relates (2) a signified (= the perturbation) (3) to a signmaker (= the system). In a third section, consequences of this concept for the knowledge about techno-social information processes and information structures will be focused on.},
	language = {en},
	number = {1},
	urldate = {2013-12-02},
	journal = {tripleC: Communication, Capitalism \& Critique. Open Access Journal for a Global Sustainable Information Society},
	author = {Hofkirchner, Wolfgang},
	month = dec,
	year = {2012},
	pages = {6--12},
	file = {Hofkirchner.2013.EmergentInformation.WhenADifferenceMakesADifference.pdf:/media/data/vveitas/gdrive/vveitas@gmail.com/library/Hofkirchner.2013.EmergentInformation.WhenADifferenceMakesADifference.pdf:application/pdf}
}

@inproceedings{heylighen_cognitive_1991,
	title = {Cognitive {Levels} of {Evolution}: from pre-rational to meta-rational},
	shorttitle = {Cognitive {Levels} of {Evolution}},
	abstract = {The principle of natural selection is taken as a starting point for an analysis of evolutionary levels. Knowledge and values are conceived as vicarious selectors of actions from a repertoire. The concept of

repository: singnet/offernet

repo_name: singnet/offernet

gha_language: HTML