Programs

The biomedical literature makes extensive use of the concept of a genetic program. So far, however, the nature of genetic programs has received no satisfactory elucidation from the standpoint of computer science. This unsettling omission has led to doubts about the very existence of genetic programs, on the grounds that gene regulatory networks lack a predetermined schedule of execution, which may seem to contradict the very idea of a program. I show, however, that we can make perfect sense of genetic (...) programs, if only we abandon the preconception that all computers have a von Neumann architecture. Instead, genetic programs instantiate the computational architecture of Post–Newell Production Systems. That is, genetic programs are unordered sets of conditional instructions, instructions that fire independently when their conditions are matched. For illustration I present a paradigm Production System that regulates the functioning of the well-known lac operon of E. coli. On close reflection it turns out that not only genes, but also proteins encode instructions. I propose, therefore, to rename genetic programs to biomolecular programs. Biomolecular and/or genetic programs, and the cellular computers than run them, are to be understood not as von Neumann computers, but as Post–Newell production systems. (shrink)

The van Wijngaarden grammars are two-level grammars that present many interesting properties. In the present article I elaborate on six of these properties, to wit, (i) their being constituted by two grammars, (ii) their ability to generate (possibly infinitely many) strict languages and their own metalanguage, (iii) their context-sensitivity, (iv) their high descriptive power, (v) their productivity, or the ability to generate an infinite number of production rules, and (vi) their equivalence with the unrestricted, or Type-0, Chomsky grammars.

Expressiveness and decidability are two core aspects of programming languages that should be thoroughly known by those who use them; this includes knowledge of their metalanguages a.k.a. formal grammars. The van Wijngaarden grammars (WGs) are capable of generating all the languages in the Chomsky hierarchy and beyond; this makes them a relevant tool in the design of (more) expressive programming languages. But this expressiveness comes at a very high cost: The syntax of WGs is extremely complex and the decision problem (...) for the generated languages is generally unsolvable. With this in mind, I provide here a short primer of the syntax of WGs, which includes syntactic restrictions that guarantee decidability for the corresponding generated languages. (shrink)

This article created to address the current state of affairs, which has resulted in an insufficient progress and innovation system. The purpose of this overview article is to increase educate society's knowledge of how to use modern and innovative technologies based on need, cultural aspects, social context, and state context. As a result, I used secondary sources to assist readers understand how state actors and policies might best respond to society's aspirations to use and communicate through technology and information, as (...) well as innovation, in a fair and equitable approach. It might be either positive or negative. Modernization and innovation can primarily noticed constructively. It means that before bringing forward and totally researching [technology], we must analyse what we need, how we treat it, and why we use it. (shrink)

While scientific inquiry crucially relies on the extraction of patterns from data, we still have a far from perfect understanding of the metaphysics of patterns—and, in particular, of what makes a pattern real. In this paper we derive a criterion of real-patternhood from the notion of conditional Kolmogorov complexity. The resulting account belongs to the philosophical tradition, initiated by Dennett :27–51, 1991), that links real-patternhood to data compressibility, but is simpler and formally more perspicuous than other proposals previously defended in (...) the literature. It also successfully enforces a non-redundancy principle, suggested by Ladyman and Ross, that aims to exclude from real-patternhood those patterns that can be ignored without loss of information about the target dataset, and which their own account fails to enforce. (shrink)

The Curry-Howard isomorphism is a proof-theoretic result that establishes a connection between derivations in natural deduction and terms in typed lambda calculus. It is an important proof-theoretic result, but also underlies the development of type systems for programming languages. This fact suggests a potential importance of the result for a philosophy of code.

Cloud computing has provided many opportunities to businesses and individuals. It enables global and on demand network access to a shared pool of resources with minimal management effort. However, this bliss has become a problem for latency-sensitive applications. To improve efficiency of cloud and to reduce the amount of data that needs to be transported to the cloud for data processing, analysis and storage, a new network architect technology 'Fog Computing' has been introduced. In fog computing, small applications and resources (...) are processed at the edge of the cloud, rather than processing entire applications on the cloud. (shrink)

The formal and empirical-generative perspectives of computation are demonstrated to be inadequate to secure the goals of simulation in the social sciences. Simulation does not resemble formal demonstrations or generative mechanisms that deductively explain how certain models are sufficient to generate emergent macrostructures of interest. The description of scientific practice implies additional epistemic conceptions of scientific knowledge. Three kinds of knowledge that account for a comprehensive description of the discipline were identified: formal, empirical and intentional knowledge. The use of formal (...) conceptions of computation for describing simulation is refuted; the roles of programming languages according to intentional accounts of computation are identified; and the roles of iconographic programming languages and aesthetic machines in simulation are characterized. The roles that simulation and intentional decision making may be able to play in a participative information society are also discussed. (shrink)

Although reducing the costs of software maintenance has long been held as an important goal, few researchers have studied software maintenance — except in the context of software design. However, thinking in software design is itself muddled by the frequent confusion over the term ‘software’ and ‘programs’. In this paper we argue for a re-examination of the underlying philosophical foundations of programs, in order to establish software as a phenomenon in its own right. Once we understand the basic structure of (...) software theories, we will be in a better position to understand how theories of software relate to theories of programs. This might finally provide the insight needed to achieve the long awaited reduction in the cost of software maintenance. (shrink)

This article asks what is creative about the act of programming. Observing that in most programming contexts, each line of code is written with a specific end in mind, it would seem as though there is little room for creativity, as the ends constrain the choices of means. However, there are many features of coding languages that open up creative possibilities. Object-oriented coding environments purport to make programming more about structures that humans might work with and less about features of (...) computers, and other innovative coding techniques, such as RTTI design, suggest that there may be no limit to the creative possibilities of code. (shrink)

This article reports an exploratory survey of the structure of interdisciplinary research in Agent-Based Social Simulation. One hundred and ninety six researchers participated in the survey completing an on-line questionnaire. The questionnaire had three distinct sections, a classification of research domains, a classification of models, and an inquiry into software requirements for designing simulation platforms. The survey results allowed us to disambiguate the variety of scientific goals and modus operandi of researchers with a reasonable level of detail, and to identify (...) a classification of agent-based models used in simulation. In particular, in the interdisciplinary context of social-scientific modelling, agent-based computational modelling and computer engineering, we analyse the extent to which these paradigmatic models seem to be mutually instrumental in the field. We expect that our proposal may improve the viability of submitting, explaining and comparing agent-based simulations in articles, which is an important methodological requirement to consolidate the field. We also expect that it will motivate other proposals that could further validate, extend or change ours, in order to refine the classification with more types of models. (shrink)

Ceruzzi pens a history of computing from the development of the first electronic digital computer to the Web and dot-com crash.

In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/} holds in this new setting, prove soundness (...) of a Hoare calculus relative to our semantics, give a direct calculus ${\cal C}$ on programs, and prove that the denotation of any program $P$ in our semantics is equal to the union of the denotations of all those programs $L$ such that $P$ follows from $L$ in our calculus and $L$ does not contain recursion or choice. (shrink)

Until the late 19th century scientists almost always assumed that the world could be described as a rule-based and hence deterministic system or as a set of such systems. The assumption is maintained in many 20th century theories although it has also been doubted because of the breakthrough of statistical theories in thermodynamics (Boltzmann and Gibbs) and other fields, unsolved questions in quantum mechanics as well as several theories forwarded within the social sciences. Until recently it has furthermore been assumed (...) that a rule-based and deterministic system was also predictable if only the rules were known, but this assumption has now been undermined by modern chaos-theory describing rule-based and deterministic, but unpredictable systems, while catastrophe-theory delivers a set of types describing various kinds of instability and conditions for the stability of a given system. Hence the main trait in the theoretical development in the 20th-century science can be described as a basic modification and limitation of some of the fundamental and strong assumptions forwarded in the previous epochs of modern science. Ironically, the very same process has been a process in which the human capacity to intervene in nature has expanded dramatically and mainly with the help of the very same theories, and not least because they allow nature to be described and made manipulable on a lower level and a more fine-grained scale. While the overall theoretical consistency between the various theories has gone, the reach of human intervention in nature has increased based on quite new dimensions whether in the area of physics (e.g.: energy technologies, chemical technologies, nanotechnologies etc.) or biology (ge¬netic manipulation) or in the area of psychology, sociology and culture (artificial simulations of mental processes, new means of communication, implying changes in the social infrastructure and cultural behaviour etc.). While some of these changes and new conditions can be reflected from within the conceptual framework of rule-based systems, albeit more complex than formerly recognized, others seem to give rise to the question of whether there are »systems« and relations between different systems in the world which are not rule-based? For instance, it seems to be obvious that the notion of instability represents a major conceptual break with former theories of rule-based systems, as the stability of the latter is an axiomatically given property implied in the very notion of rule-based systems, while instability can only be the result of external influence which should be explained as the result of another rule-based sy¬stem. While there are no difficulties implied concerning the stability of rule-based systems, the notion of unstable states of a system raises the question of how there can be a system at all if there are no invariant stabilising principles? This is the first question which I will address. And I shall do so by taking two examples of such systems as my point of departure. The first example will be the computer and the second will be ordinary language. In both cases I will argue that the stability of these systems (which are both defined by the existence/presence of human intentions) are provided by the help of - differently organised - redundancy functions which both allow the maintenance of systems in unstable macro-states, suspension of previous rules, underdetermination and overdetermination and generation/emergence/creation of new rules more or less independent of previous rules by the help of optional recursions to the permanently accessible underlying levels as for instance the level of binary representation in computers. Since the notion of redundancy is both controversial as such and often avoided, the concept is discussed (as defined in Claude Shannon's mathematical theory of information and in the semiotic framework of J. J. Greimas) and leading to a more general definition in which the redundancy functions serve to overcome noisy conditions, but at the cost of rule-based stability, determination, and predictability. A second question will be how the notion of rule-generating systems relates to the notion of anticipatory systems and it will be argued that rule-generating systems share some features with an¬ticipatory systems and that the former from a certain viewpoint can be seen as a subclass of the latter, although anticipative features are not necessarily a part of the definition of rule-generating systems. On the other hand, it will be discussed whether anticipatory systems which are not rule-generating systems can exist and it will be argued that the capacity to anticipate is strongly limited if it is not part of a rule-generating system. Therefore, it is concluded that the most powerful anticipatory systems need to be rule-generating systems. (shrink)

Law and legal reasoning are a natural target for artificial intelligence systems. Like medical diagnosis and other tasks for expert systems, legal analysis is a matter of interpreting data in terms of higher-level concepts. But in law the data are more like those for a system aimed at understanding natural language: they tell a story about human events that may lead to a lawsuit. Statements of the law, too, are written in natural language and legal arguments are often arguments about (...) what that language means or ought to mean.This study is one of the few research efforts in this fertile area. It is unique in developing a computational model for analyzing legal problems in a way that brings these strands of AI research together and makes sense from a jurisprudential perspective as well.Gardner first analyzes several positions in Anglo-American jurisprudence and their relevance for work in artificial intelligence. She identifies aspects of legal reasoning that any truly expert system in law must make a place for and suggests a way of decomposing the process of legal analysis that takes these aspects into account. She compares the resulting framework with those used by other legal analysis programs. A solid exposition of current AI techniques follows in chapters covering the author's system (written in Maclisp) for offer and acceptance problems, taken from law examinations, involved in contract law.Anne von der Lieth Gardner has a law degree and a Ph.D. in computer science, both from Stanford University. An Artificial Intelligence Approach to Legal Reasoning inaugurates the series Artificial Intelligence and the Law: Processes and Models of Legal Reasoning, edited by L. Thorne McCarty and Edwina L. Rissland. A Bradford Book. (shrink)

As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...) many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. -/- For my money, Gentzen’s natural deduction and Church’s lambda calculus are on a par with Einstein’s relativity and Dirac’s quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I’ll need a few symbols, but not too many, and I’ll explain as I go along. -/- To simplify, I’ll present the story as we understand it now, with some asides to fill in the history. First, I’ll introduce Gentzen’s natural deduction, a formalism for proofs. Next, I’ll introduce Church’s lambda calculus, a formalism for programs. Then I’ll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. Finally, I’ll conclude with a look at how these principles are being applied to design a new generation of programming languages, particularly mobile code for the Internet. (shrink)