A New Theory of Consciousness: The Missing Link - Organization

What is consciousness and what is the missing link between the sensory input and the cortical centre in the brain for consciousness? In the literature there are more than a million pages written about consciousness. The perspectives range from the field of metaphysics to those of quantum mechanics. However, no one today has produced a theory which is universally accepted. Consciousness is “something” which the majority of humans know that they posses, they use it when they want to understand their environment. However, no individual human knows whether other humans also posses consciousness. unless some tests such as she is looking at me, he is talking etc., are performed. We are caught in an intellectual sort of recursive carousel – we need consciousness to understand consciousness. To understand consciousness we have to understand the mechanism of its function, which is to effectively organize sensory inputs from our environment. Consciousness is the outcome of the process of organizing these sensory inputs. This implies that organization is an act which precedes consciousness. Since every activity in nature is to organize/disorganize, what is the element which compels this action? I am proposing that just like energy is the physical element that causes action, there is another physical element I have called it NASCIUM which has the capacity to cause organization. This is the missing link. Understanding the nature of organization, i.e. nascium, will enhance our capability to understand consciousness

An "All Hands" Call to the Social Science Community: Establishing a Community Framework for Complexity Modeling Using Agent Based Models and Cyberinfrastructure

To date, many communities of practice (COP) in the social sciences have been struggling with how to deal with rapidly growing bodies of information. Many CoPs across broad disciplines have turned to community frameworks for complexity modeling (CFCMs) but this strategy has been slow to be discussed let alone adopted by the social sciences communities of practice (SS-CoPs). In this paper we urge the SS-CoPs that it is timely to develop and establish a CBCF for the social sciences for two major reasons: the rapid acquisition of data and the emergence of critical cybertools which can facilitate agent-based, spatially-explicit models. The goal of this paper is not to prescribe how a CFCM might be set up but to suggest of what components it might consist and what its advantages would be. Agent based models serve the establishment of a CFCM because they allow robust and diverse inputs and are amenable to output-driven modifications. In other words, as phenomena are resolved by a SS-CoP it is possible to adjust and refine ABMs (and their predictive ability) as a recursive and collective process. Existing and emerging cybertools such as computer networks, digital data collections and advances in programming languages mean the SS-CoP must now carefully consider committing the human organization to enabling a cyberinfrastructure tool. The combination of technologies with human interfaces can allow scenarios to be incorporated through 'if' 'then' rules and provide a powerful basis for addressing the dynamics of coupled and complex social ecological systems (cSESs). The need for social scientists to be more engaged participants in the growing challenges of characterizing chaotic, self-organizing social systems and predicting emergent patterns makes the application of ABMs timely. The enabling of a SS-CoP CFCM human-cyberinfrastructure represents an unprecedented opportunity to synthesize, compare and evaluate diverse sociological phenomena as a cohesive and recursive community-driven process.Community-Based Complex Models, Mathematics, Social Sciences

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of Bjorner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give an recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.Comment: 16 pages; more detail added to some proofs; Corollary 2.10 was been clarified; the beginning of Section 4 has been rewritten; references updated; to appear in J. Combin. Theory, Ser.

Programmability of Chemical Reaction Networks

Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a well-stirred solution according to standard chemical kinetics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines. A theme to these investigations is the thin line between decidable and undecidable questions about SCRN behavior

Romantic Partnerships and the Dispersion of Social Ties: A Network Analysis of Relationship Status on Facebook

A crucial task in the analysis of on-line social-networking systems is to identify important people --- those linked by strong social ties --- within an individual's network neighborhood. Here we investigate this question for a particular category of strong ties, those involving spouses or romantic partners. We organize our analysis around a basic question: given all the connections among a person's friends, can you recognize his or her romantic partner from the network structure alone? Using data from a large sample of Facebook users, we find that this task can be accomplished with high accuracy, but doing so requires the development of a new measure of tie strength that we term `dispersion' --- the extent to which two people's mutual friends are not themselves well-connected. The results offer methods for identifying types of structurally significant people in on-line applications, and suggest a potential expansion of existing theories of tie strength.Comment: Proc. 17th ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW), 201

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature