This paper introduces Exclusion Logic - a simple modal logic without negation or disjunction. We show that this logic has an efficient decision procedure. We describe how Exclusion Logic can be used as a deontic logic. We compare this deontic logic with Standard Deontic Logic and with more syntactically restricted logics.

ABSTRACT In this paper we explore how a public national media outlet, the British BBC, represents an international legal case which has a highly political nature. The case is US versus Huawei/meng Wanzhou, which took place between 2018 and 2021. Accusations were that the Chinese technology company committed fraud, leading the global HSBC bank to breach US sanctions against Iran. The charges were made by the US using what is called an ‘extraterritorial law’, which, while rejected as law by governments (...) around the world, is policed by US economic powers and control over international finance. Using Critical Discourse Analysis we show that, while the BBC presents much detail of legal process, the actual nature of the law the US uses to bring criminal charges against international companies and banks, is neither considered nor questioned. Our interest is how such a law, which has a huge influence over global trade and politics, is presented to the public in this particular case. We contribute to the position that the nature of laws, how they are used and known, must always be understood within the prevailing discourses of the moment. (shrink)

Introduction. During the past two decades philosophers of psychology have considered a large variety of computational models for philosophy of mind and more recently for cognitive science. Among the suggested models are computer programs, Turing machines, pushdown automata, linear bounded automata, finite state automata and sequential machines. Many philosophers have found finite state automata models to be the most appealing, for various reasons, although there has been no shortage of defenders of programs and Turing machines. A (...) paper by Arthur Burks convinced me long ago that “all natural human functions” are, or can be fruitfully modeled to be, finite state automata with output. Further work in the field has reinforced this conviction. There is room, however, for the use of any of the above models in philosophy of mind and in the ongoing development of cognitive science. (shrink)

The uniform halting problem (UH) can be stated as follows:Give a decision procedure which for any given Turing machine (TM) will decide whether or not it has an immortal instantaneous description (ID).An ID is called immortal if it has no terminal successor. As it is generally the case in the literature (see e.g. Minsky [4, p. 118]) we assume that in an ID the tape must be blank except for some finite number of squares. If we remove this (...) restriction the UH becomes the immortality problem (IP). (shrink)

The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So (...) it is with computing, which can be analog or digital, and is often mixed. The theory behind computers is essentially digital, but efficient simulations of phenomena can be performed by analog devices; indeed, any physical calculation requires implementation in the physical world and is therefore analog to some extent, despite being based on abstract logic and arithmetic. The mammalian brain, comprised of neuronal networks, functions as an analog device and has given rise to artificial neural networks that are implemented as digital algorithms but function as analog models would. Analog constructs compute with the implementation of a variety of feedback and feedforward loops. In contrast, digital algorithms allow the implementation of recursive processes that enable them to generate unparalleled emergent properties. We briefly illustrate how the cortical organization of neurons can integrate signals and make predictions analogically. While we conclude that brains are not digital computers, we speculate on the recent implementation of human writing in the brain as a possible digital path that slowly evolves the brain into a genuine (slow) Turing machine. (shrink)

This paper engages with debates about the increasing use of paid domestic labour in Europe and the USA, contributing with a reflection about the case of Brazil. Relations of gender, class and race are considered in the deployment of maids for housework, the patterns of consumption of household technologies and the moral reasoning of daily living with hierarchical divisions within the home. The paper considers some parallels between the Brazilian context and that of more developed countries and also the (...) specificity of Brazil. Based on participant observation, secondary data and an ethnographic study, rich empirical data is weaved through to discuss material and moral dimensions of domestic labour and care. How does the availability of cheap domestic labour configure relations of inequality? How are social differences in the home lived with and justified? The exploration of the Brazilian case illuminates some of the problems, contradictions and possible consequences of wealthier households benefitting from the displacement of poor women that is currently happening through international migration. The paper argues that in Brazil the deflecting of tensions in gender divisions of labour in households onto a subordinate person has affected relations of equality between women and men and also the patterns of technological innovation to facilitate housework. These are outcomes to be guarded against in Europe and the United States in face of the current trends in ‘global woman’ relations. (shrink)

We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing strategies which are implementable by a machine with a bound on its complexity. One player has to use a finite automaton while the other player has to use a finite perceptron. Some examples illustrate that the sets of strategies which are induced by these two types of machines are different and not ordered by set inclusion. Repeated game payoffs are evaluated according to (...) the limit of means. The main result establishes that a cooperation at almost all stages of the game is an equilibrium outcome if the complexity of the machines the players may use is limited enough and if the length T of the repeated game is sufficiently large. This result persists when more than T states are allowed in the player’s automaton. We further consider a variant of the model in which the two players are restricted to choosing strategies which are implementable by perceptrons and prove that the players can cooperate at most of the stages provided that the complexity of their perceptrons is sufficiently reduced. (shrink)

We exhibit a construction which produces for every Turing machine T with two halting states μ 0 and μ -1 , an algebra B(T) (finite and of finite type) with the property that the variety generated by B(T) is residually large if T halts in state μ -1 , while if T halts in state μ 0 then this variety is residually bounded by a finite cardinal.

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step 25-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns (...) on the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is.. (shrink)

The science fiction films of Andrei Tarkovsky, Solaris (1973) and Stalker (1979), are complex responses to the repressive atmosphere of Brezhnev’s rule, after the 7-year delay in seeing Andrei Rublev (1971) released publicly. By using science fiction—a genre that Tarkovsky openly maligned—he was able to fly beneath the radar of State censorship, and develop a nuanced response to the application of Marxist theory of religion in the Soviet experience. Arguing in these films (and in others in his oeuvre) that (...) humans still need the affective dimension of religion (though not the hierarchical, institutional elements of it that Marx had identified with sedation), Tarkovsky hid within his science fiction films a thoroughgoing critique of the Soviet application of Marx. This article uses the concept of “war machine” from the philosophy of Gilles Deleuze and Félix Guattari to analyze how Tarkovsky did this, and demonstrates that Tarkovsky’s engagement with Marx’s philosophy in these two films shares much in common with Deleuze and Guattari’s way of understanding human meaning making. (shrink)

Finite-state methods are applied to determine the consequences of events, represented as strings of sets of fluents. Developed to flesh out events used in natural language semantics, the approach supports reasoning about action in AI, including the frame problem and inertia. Representational and inferential aspects of the approach are explored, centering on conciseness of language, context update and constraint application with bias.

Finite-state methods are applied to the Russell-Wiener notion of time (based on events) and developed into an account of interval relations and temporal propositions. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and non-deterministic relations defining notions of partiality within and across such levels.

Finite-state descriptions for temporal semantics are outlined through which to distinguish soft inferences reflecting manners of conceptualization from more robust semantic entailments defined over models. Just what descriptions are built (before being interpreted model-theoretically) and how they are grounded in models of reality explain (upon examination) why some inferences are soft.

Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and notions of containment for partiality within and across such levels.

We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.

Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with par- tial valuations. The usual regular constructs (concatena- tion, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.

This paper proposes an innovative approach to achieving real-time polymorphic behavior detection, and its direct application to blockchain-focused smart-contracts. We devise a method based on a non-deterministic finite state machine to perform approximate pattern-matching, using a look-ahead mechanism implemented through a concept similar to that of a sliding window, and using threshold-based similarity checking at every state in the automaton. We introduce and formalize our approach, discuss the challenges we faced and then test it in a (...) real-world environment. The experimental results obtained showed a significant speed-up of our approach, as compared to the classic similarity measures used commonly in such scenarios. (shrink)

Numbers. Natural numbers -- Integers -- Real numbers -- Irrational and transcendental numbers -- Funny numbers. Zero -- e : the unnatural natural number -- [Phi] : the golden ratio -- i : the imaginary number -- Writing numbers. Roman numerals -- Egyptian fractions -- Continued fractions -- Logic. Mr. Spock is not logical -- Proofs, truth, and trees : oh my! -- Programming with logic -- Temporal reasoning -- Sets. Cantor's diagonalization : infinity isn't just infinity -- Axiomatic set (...) theory : keep the good, dump the bad -- Models : using sets as the LEGOs of the math world -- Transfinite numbers : counting and ordering infinite sets -- Group theory : finding symmetries with sets -- Mechanical math. Finite state machines : simplicity goes far -- The turing machine -- Pathology and the heart of computing -- Calculus : no, not that calculus- [lambda] calculus -- Numbers, booleans, and recursion -- Types, types, types : modeling [lambda] calculus -- The halting problem. (shrink)

Hilary Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementation. It also raises questions about the class of automata that can serve as a basis for (...) understanding the mind. I develop an account of implementation, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on the system. This clears the way for computation to play a central role in the analysis of mind. (shrink)

We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study.1.

We present a theory that copes with the dynamics of inconsistent information. A method is set forth to represent possibly inconsistent information by a finite state. Next, finite operations for expansion and contraction of finite states are given. No extra-logical element — a choice function or an ordering over (sets of) sentences — is presupposed in the definition of contraction. Moreover, expansion and contraction are each other's duals. AGM-style characterizations of these operations follow.

The “surge in use of finite-state methods” ([10]) in computational linguistics has largely, if not completely, left semantics untouched. The present paper is directed towards correcting this situation. Techniques explained in [1] are applied to a fragment of temporal semantics through an approach we call finite-state temporality. This proceeds from the intuition of an event as “a series of snapshots” ([15]; see also [12]), equating snapshots with symbols that collectively form our alphabet. A sequence of snapshots (...) then becomes a string over that alphabet, evoking comic/film strips. Jackendoff has, among others, objected to conceptualizing events in terms of snapshots ([8]). To counter these objections, we step up from events-as-strings to event-typesas-regular languages ([5, 6]), recognizing the need for variable granularity. Beyond the introduction of disjunction implicit in the step from a single string up to a set of strings, we obtain a useful logic from the regular operations and a careful choice of the snapshots (constituting our alphabet). (shrink)

This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as μxE = μxE[E/x] some notation for substitutions is required. Accordingly, the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first order variables. A notion of first order trace congruence over such terms is introduced and used to show that no (...) finite set of such equations is sound and complete for any reasonable equivalence finer than trace equivalence. The intermediate results are then applied to give two nonaxiomatisability results over calculi of regular expressions. (shrink)

Evans & Levinson's (E&L's) major point is that human languages are intriguingly diverse rather than (like animal communication systems) uniform within the species. This does not establish a about language universals, or advance the ill-framed pseudo-debate over universal grammar. The target article does, however, repeat a troublesome myth about Fitch and Hauser's (2004) work on pattern learning in cotton-top tamarins.

Turing's World is a self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to design, debug, and run sophisticated Turing machines in a graphical environment on the Macintosh. Turning's World introduces users to the key concpets in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. Exercises then progress (...) through a significant portion of elementary computability theory, covering such topics as the Halting problem, the Busy Beaver function, recursive functions, and undecidability. Version 3.0 is an extensive revision and enhancement of earlier releases of the program, allowing the construction of one-way and two-way finite state machines (finite automata), as well as nondeterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines. (shrink)

Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal and formal methods. Applications of this method motivate a number of computability and decidability problems connected to ASMs. Such problems result for example from the area of verifying properties of ASMs. Their high expressive power leads rather directly to undecidability respectively uncomputability results for most interesting problems in the case of unrestricted ASMs. Consequently, it is rather natural (...) to ask whether there exist expressive classes of ASMs for which we can prove positive decidability and computability results. In this work, we introduce such a class of ASMs. The concept is similar to the one of the guarded fragment of first-order logic. We analyze the expressive power of this class and prove that it is stronger than Datalog LITE and the guarded fragment of first-order fixed point logic. Some decidability and computability results have been proven in earlier works. (shrink)

We show that the fundamental legal structure of a well-written financial contract follows a state-transition logic that can be formalized mathematically as a finite-state machine (specifically, a deterministic finite automaton or DFA). The automaton defines the states that a financial relationship can be in, such as “default,” “delinquency,” “performing,” etc., and it defines an “alphabet” of events that can trigger state transitions, such as “payment arrives,” “due date passes,” etc. The core of a contract (...) describes the rules by which different sequences of events trigger particular sequences of state transitions in the relationship between the counterparties. By conceptualizing and representing the legal structure of a contract in this way, we expose it to a range of powerful tools and results from the theory of computation. These allow, for example, automated reasoning to determine whether a contract is internally coherent and whether it is complete relative to a particular event alphabet. We illustrate the process by representing a simple loan agreement as an automaton. (shrink)

This paper proposes a model for implementation of intrinsic natural language sentence meaning in a physical language understanding system, where 'intrinsic' is understood as 'independent of meaning ascription by system-external observers'. The proposal is that intrinsic meaning can be implemented as a point attractor in the state space of a nonlinear dynamical system with feedback which is generated by temporally sequenced inputs. It is motivated by John Searle's well known (Behavioral and Brain Sciences, 3: 417–57, 1980) critique of the (...) then-standard and currently still influential computational theory of mind (CTM), the essence of which was that CTM representations lack intrinsic meaning because that meaning is dependent on ascription by an observer_._ The proposed dynamical model comprises a collection of interacting artificial neural networks, and constitutes a radical simplification of the principle of compositional phrase structure which is at the heart of the current standard view of sentence semantics because it is computationally interpretable as a finite state machine. (shrink)

The aim of this paper is to shed light on our understanding of large scale properties of infinite strings. We say that one string $\alpha $ has weaker large scale geometry than that of $\beta $ if there is color preserving bi-Lipschitz map from $\alpha $ into $\beta $ with small distortion. This definition allows us to define a partially ordered set of large scale geometries on the classes of all infinite strings. This partial order compares large scale geometries of (...) infinite strings. As such, it presents an algebraic tool for classification of global patterns. We study properties of this partial order. We prove, for instance, that this partial order has a greatest element and also possess infinite chains and antichains. We also investigate the sets of large scale geometries of strings accepted by finite state machines such as Büchi automata. We provide an algorithm that describes large scale geometries of strings accepted by Büchi automata. This connects the work with the complexity theory. We also prove that the quasi-isometry problem is a $\Sigma _2^0$ -complete set, thus providing a bridge with computability theory. Finally, we build algebraic structures that are invariants of large scale geometries. We invoke asymptotic cones, a key concept in geometric group theory, defined via model-theoretic notion of ultra-product. Partly, we study asymptotic cones of algorithmically random strings, thus connecting the topic with algorithmic randomness. (shrink)

In large-scale assessments, disengaged participants might rapidly guess on items or skip items, which can affect the score interpretation’s validity. This study analyzes data from a linear computer-based assessment to evaluate a micro-intervention that blocked the possibility to respond for 2 s. The blocked response was implemented to prevent participants from accidental navigation and as a naive attempt to prevent rapid guesses and rapid omissions. The response process was analyzed by interpreting log event sequences within a finite-state (...) class='Hi'>machine approach. Responses were assigned to different response classes based on the event sequence. Additionally, post hoc methods for detecting rapid responses based on response time thresholds were applied to validate the classification. Rapid guesses and rapid omissions could be distinguished from accidental clicks by the log events following the micro-intervention. Results showed that the blocked response interfered with rapid responses but hardly led to behavioral changes. However, the blocked response could improve the post hoc detection of rapid responding by identifying responses that narrowly exceed time-bound thresholds. In an assessment context, it is desirable to prevent participants from accidentally skipping items, which in itself may lead to an increasing popularity of initially blocking responses. If, however, data from those assessments is analyzed for rapid responses, additional log data information should be considered. (shrink)

Frankfurt’s “Alternate Possibilities and Moral Responsibility” made an important intervention into the literature on moral responsibility via a classical Frankfurt-type example, arguing that “the principle of alternate possibilities” is false. This paper argues that classical Frankfurt-type examples fail due to the use of agentic counterfactual interventions who lack agency. Using finite state machines to illustrate, I show the models that classical Frankfurt-type examples must use and why they are incongruent with leeway incompatibilist beliefs—the motivating interlocutor for classical Frankfurt-type (...) examples. I then argue that returning agency to the agentic counterfactual intervention also returns alternate possibilities to the actual sequence of events, undermining a core premise of Frankfurt’s. Lastly, I show why a number of potential counterarguments should fail to persuade the leeway incompatibilist. (shrink)

In the first part of this paper, two arguments, one by Chomsky, and one by Bar-Hillel and Shamir, are examined in detail and rejected. Both arguments purport to show that the structure of English precludes its having a finite state grammar which correctly enumerates just the well formed sentences of English. In the latter part of the paper I consider the problem of supporting claims about the structure and properties of a natural language when no grammar for the (...) language has yet been accepted. (shrink)

The paper describes a decidable class of verification problems expressed in first order timed logic. To specify programs we useState Machines. It is known that Abstract State Machines and first order timed logic are two very powerful formalisms apt to represent verification problems for timed distributed systems. However, the general verification problem represented in this way is undecidable. Prior, some decidable classes of verification problems were described in semantical properties that are in their turn undecidable. The decidable class of (...) the present paper is described in syntactical terms. Though it admits no functions, only predicates, it is of practical interest and we give an example illustrating possible applications. (shrink)

Recovery is a model of care in (forensic) mental health settings across Western nations that aims to move past the paternalistic and punitive models of institutional care of the 20th century and toward more patient‐centered approaches. But as we argue in this paper, the recovery‐oriented services that evolved out of the early stages of this liberating movement signaled a shift in nursing practices that cannot be viewed only as improvements. In effect, as “recovery” nursing practices became more established, more codified, (...) and more institutional(ized), a stasis developed. Recovery had been reterritorialized. The purpose of this paper is to examine some of the threads of recovery, from its early days of antipsychiatry activism to its codification into mental health—including forensic mental health—institutions through the lens of poststructuralist philosophers Gilles Deleuze and Felix Guattari. We believe that Deleuze and Guattari's scholarship provides the necessary, albeit uncomfortable, framework for this critical examination. From a conceptualization of recovery as an assemblage, we critically examine how we can go about creating something new, caught in a tension between stasis and change. (shrink)

The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...) important implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set ( x )”. Then, equating Q ( x ) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (shrink)

What is nontrivial digital computation? It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accords with the common intuition that digital computation is a type of information processing. We use the notion of reachability in a graph to defend this characterization in memory-based systems and underscore the importance of instructional (...) information for digital computation. We argue that our account evaluates positively against adequacy criteria for accounts of computation. (shrink)

Reichenbach's event, reference and speech times are interpreted semantically by stringing and superposing sets of temporal formulae, structured within regular languages. Notions of continuation branches and of inertia, bound (in a precise sense) by reference time, are developed and applied to the progressive and the perfect.

There are currently considerable confusion and disarray about just how we should view computationalism, connectionism and dynamicism as explanatory frameworks in cognitive science. A key source of this ongoing conflict among the central paradigms in cognitive science is an equivocation on the notion of computation simpliciter. ‘Computation’ is construed differently by computationalism, connectionism, dynamicism and computational neuroscience. I claim that these central paradigms, properly understood, can contribute to an integrated cognitive science. Yet, before this claim can be defended, a better (...) understanding of ‘computation’ is required. ‘Digital computation’ is an ambiguous concept. It is not just the classical dichotomy between analogue and digital computation that is the basis for the equivocation on ‘computation’ simpliciter in cognitive science, but also the diversity of extant accounts of digital computation. There are many answers on what it takes for a system to perform digital computation. Answers to this problem range from Turing machine computation, through the formal manipulation of symbols, the execution of algorithms and others, to the strong-pancomputational thesis, according to which every physical system computes every Turing-computable function. Despite some overlap among them, extant accounts of concrete digital computation are non-equivalent, thus, rendering ‘digital computation’ ambiguous. The objective of this dissertation is twofold. First, it is to promote a clearer understanding of concrete digital computation. Accordingly, my main thesis is that not only are extant accounts of concrete digital computation non-equivalent, but most of them are inadequate. I show that these accounts are not just intensionally different (this is quite trivially the case), but also extensionally distinct. In the course of examining several key accounts of concrete digital computation, I propose the instructional information processing account, according to which digital computation is the processing of discrete data in accordance with finite instructional information. The second objective is to establish the foundational role of computation in cognitive science whilst rejecting the purported representational nature of computation. (shrink)