The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). This result is shown to be optimal since we also present a string automatic structure of bounded degree whose first-order theory is (...) hard for 2EXPSPACE. We prove similar results also for tree automatic structures. These findings close the gaps left open in [28] by improving both the lower and the upper bounds. (shrink)

We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, (...) non commutative rings, non commutative groups) is not determined by the axiomatic system ZFC. We infer from the proof of the above result that the isomorphism problem for ω n -automatic boolean algebras, n ≥ 2, (respectively, rings, commutative rings, non commutative rings, non commutative groups) is neither a ${\mathrm{\Sigma }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ nor a ${\mathrm{\Pi }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ . We obtain that there exist infinitely many ω n -automatic, hence also ω-tree-automatic, atomless boolean algebras $\mathcal{B}_{n}$ , n ≥ 1, which are pairwise isomorphic under the continuum hypothesis CH and pairwise non isomorphic under an alternate axiom AT, strengthening a result of [14]. (shrink)

The logic L (Qu) extends first-order logic by a generalized form of counting quantifiers ("the number of elements satisfying... belongs to the set C"). This logic is investigated for structures with an injectively ω-automatic presentation. If first-order logic is extended by an infinity-quantifier, the resulting theory of any such structure is known to be decidable [6]. It is shown that, as in the case of automatic structures [21], also modulo-counting quantifiers as well as infinite cardinality quantifiers (...) ("there are χ many elements satisfying...") lead to decidable theories. For a structure of bounded degree with injective ω-automatic presentation, the fragment of L(Qu) that contains only effective quantifiers is shown to be decidable and an elementary algorithm for this decision is presented. Both assumptions (ω-automaticity and bounded degree) are necessary for this result to hold. (shrink)

A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent (...) automata-presentable structures is ${\rm{\Sigma }}_1^1 $-complete. We also use similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel. (shrink)

The distributional principle according to which morphemes that occur in identical contexts belong, in some sense, to the same category [1] has been advanced as a means for extracting syntactic structures from corpus data. We extend this principle by applying it recursively, and by using mutual information for estimating category coherence. The resulting model learns, in an unsupervised fashion, highly structured, distributed representations of syntactic knowledge from corpora. It also exhibits promising behavior in tasks usually thought to require representations (...) anchored in a grammar, such as systematicity. (shrink)

The objective of this paper is to characterize the rich interplay between automatic and cognitive control processes that we propose is the hallmark of skill, in contrast to habit, and what accounts for its flexibility. We argue that this interplay isn't entirely hierarchical and static, but rather heterarchical and dynamic. We further argue that it crucially depends on the acquisition of detailed and well-structured action representations and internal models, as well as the concomitant development of metacontrol processes that can (...) be used to shape and balance it. (shrink)

It is not rare in philosophy and psychology to see theorists fall into dichotomous thinking about mental phenomena. On one side of the dichotomy there are processes that I will label “unintelligent.” These processes are thought to be unconscious, implicit, automatic, unintentional, involuntary, procedural, and non-cognitive. On the other side, there are “intelligent” processes that are conscious, explicit, controlled, intentional, voluntary, declarative, and cognitive. Often, if a process or behavior is characterized by one of the features from either of (...) the above lists, the process or behavior is classified as falling under the category to which the feature belongs. For example, if a process is implicit this is usually considered sufficient for classifying it as “unintelligent” and for assuming that the remaining features that fall under the “unintelligent” grouping will apply to it as well. Accordingly, if a process or behavior is automatic, philosophers often consider it to be unintelligent. It is my goal in this paper to challenge the conceptual slip from “automatic” to “unintelligent”. I will argue that there are a whole range of properties highlighted by the existing psychological literature that make automaticity a much more complex phenomenon than is usually appreciated. I will then go on to discuss two further important relationships between automatic processes and controlled processes (C-processes) that arise when we think about automatic processes in the context of skilled behavior. These interactions should add to our resistance to classifying automaticity as unintelligent or mindless. In Sect. 1, I present a few representative cases of philosophers classifying automatic processes and behaviors as mindless or unintelligent. In Sect. 2, I review trends in the psychology of automaticity in order highlight a complex set of features that are characteristic, though not definitive, of automatic processes and behaviors. In Sect. 3, I argue that at least some automatic processes are likely cognitively penetrable. In Sect. 4, I argue that the structure of skilled automatic processes is shaped diachronically by practice, training and learning. Taken together, these considerations should dislodge the temptation to equate “automatic” with “unintelligent”. (shrink)

Khoussainov and Nerode [14] posed various open questions on model-theoretic properties of automatic structures. In this work we answer some of these questions by showing the following results: There is an uncountably categorical but not countably categorical theory for which only the prime model is automatic; There are complete theories with exactly 3,4,5,…3,4,5,… countable models, respectively, and every countable model is automatic; There is a complete theory for which exactly 2 models have an automatic presentation; (...) If LOGSPACE=PLOGSPACE=P then there is an uncountably categorical but not countably categorical theory for which the prime model does not have an automatic presentation but all the other countable models are automatic; There is a complete theory with countably many countable models for which the saturated model has an automatic presentation but the prime model does not have one. (shrink)

In this article we develop a logical model for automatic extraction of structured metadata. We introduce a new predicate???? – reads ‘extract’ – and a structure???? to syntactically and semantically define metadata extracted with any automatic metadata extraction system. These systems will be considered, in the logical model created, as knowledge extraction agents. In this case KEA taken into consideration is CERMINE, a comprehensive open-source system for extracting structured metadata from scientific articles in a born-digital form.

We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are p-divisible for infinitely many primes p, or groups of the form ⊕ p∈I Z(p ∞ ), where I is an infinite set of primes.

This paper addresses automatic partitioning in complex reinforcement learning tasks with multiple agents, without a priori domain knowledge regarding task structures. Partitioning a state/input space into multiple regions helps to exploit the di erential characteristics of regions and di erential characteristics of agents, thus facilitating learning and reducing the complexity of agents especially when function approximators are used. We develop a method for optimizing the partitioning of the space through experience without the use of a priori domain knowledge. (...) The method is experimentally tested and compared to a number of other algorithms. As expected, we found that the multi-agent method with automatic partitioning outperformed single-agent learning. (shrink)

My reply to the comments of Parkinson (2010) and Kuppens (2010) is organized in three parts. The first part deals with Parkinson’s claim that the scope of our research is limited because no real emotions were elicited. I suggest that the outcomes in our studies are structurally similar to real emotions but that they lack intensity. In the second part, I try to correct three potential misunderstandings regarding the nature of the comparison process that I proposed. In the third part, (...) I respond to Kuppens’ suggestion that we also need to consider the transition of appraisal values into the other components of emotion (actions tendencies, responses, and subjective experience). (shrink)

To grasp the current urban crisis as evoked by Rem Koolhaas’ notion of junkspace, one must address not only the failures of linguistic, philosophical and architectural representation, but also the urban models that these accounts have established. The decline of traditional religious and social structures, the rise of commodification, and the fixation on representation itself, all contribute to shaping the meaning, decline, and future of the city. The methodology draws on the psychoanalytic frameworks of Freud and Lacan, who viewed (...) psychosis as a mental construct offering fresh insights into the human mind. By integrating Jean Baudrillard’s notion of third-order simulation with Jacques Lacan’s theory of psychosis and other relevant concepts—among which is Jacques-Alain Miller’s formulation of “white psychosis”—this chapter argues that the contemporary city represents the final stage in an often-overlooked correspondence between urban environments and subjectivity. The modern megalopolis results from a process of automatic overwriting analogous to the Lacanian unconscious. By deciphering Lorens Holm’s diagram of the psychotic field of vision, validating Rem Koolhaas’ concept of junkspace, reinterpreting fin-de-siècle case study of the psychotic Judge Daniel Paul Schreber, shedding light on Baudrillard’s notion of tertiary narcissism, and exploring the interplay between the human unconscious and urban environments, this research offers significant contributions to both architecture and psychoanalysis. Not only is our understanding of architecture and urban design broadened, but the complex connections between our inner lives and the spaces we inhabit is also illuminated. Overall, Holm’s diagram and Miller’s formulation characterize what lies between Rem Koolhaas’ 2002 observations and the present day. (shrink)

The SALOMON project is a contribution to the automatic processing of legal texts. Its aim is to automatically summarise Belgian criminal cases in order to improve access to the large number of existing and future cases. Therefore, techniques are developed for identifying and extracting relevant information from the cases. A broader application of these techniques could considerably simplify the work of the legal profession.A double methodology was used when developing SALOMON: the cases are processed by employing additional knowledge to (...) interpret structural patterns and features on the one hand and by way of occurrence statistics of index terms on the other. As a result, SALOMON performs an initial categorisation and structuring of the cases and subsequently extracts the most relevant text units of the alleged offences and of the opinion of the court. The SALOMON techniques do not themselves solve any legal questions, but they do guide the user effectively towards relevant texts. (shrink)

The present study combined magnetoencephalography recordings with fast periodic visual stimulation to investigate automatic neural responses to morphemes in developing and skilled readers. Native English-speaking children and adults were presented with rapid streams of base stimuli interleaved periodically with oddballs. In a manipulation-check condition, tapping into word recognition, oddballs featured familiar words embedded in a stream of consonant strings. In the experimental conditions, the contrast between oddball and base stimuli was manipulated in order to probe selective stem and suffix (...) identification in morphologically structured pseudowords. Neural responses at the oddball frequency and harmonics were analyzed at the sensor level using non-parametric cluster-based permutation tests. As expected, results in the manipulation-check condition revealed a word-selective response reflected by a predominantly left-lateralized cluster that emerged over temporal, parietal, and occipital sensors in both children and adults. However, across the experimental conditions, results yielded a differential pattern of oddball responses in developing and skilled readers. Children displayed a significant response that emerged in a mostly central occipital cluster for the condition tracking stem identification in the presence of suffixes. In contrast, adult participants showed a significant response that emerged in a cluster located in central and left occipital sensors for the condition tracking suffix identification in the presence of stems. The present results suggest that while the morpheme identification system in Grade 5–6 children is not yet adult-like, it is sufficiently mature to automatically analyze the morphemic structure of novel letter strings. These findings are discussed in the context of theoretical accounts of morphological processing across reading development. (shrink)

To shorten the travel time and improve comfort, the automatic train driving system is considered to replace manual driving. In this article, an automatic control method of computer application data-processing system based on artificial intelligence is proposed. An automatic train operation (ATO) introduced the structure and function of an autopilot system (train), optimized the train running on the target curve, introduced the basic principle of fuzzy generalized predictive control (PC) algorithm, and combined with the characteristics of ATO (...) system design the speed controller based on optimization algorithm, the target curve to make use of the designed controller to track and simulation validation. The experimental outcomes demonstrate that when the train runs to 90 s, the displacement difference reaches about 40 m, which proves that the fuzzy PC has better displacement tracking, punctual arrival, and higher stopping accuracy. (shrink)

The differentiation of T Lymphocytes within the thymus is an important biological phenomenon during wich these cell acquire their functions to further control the immune system. Numerous experiments under various conditions have been devised to understand the different mechanisms involved in this complex process. Nevertheless, interpretation of these experiments lead to still contradictory debatable hypotheses. Modelisation of this process through classical simulation methods cannot be envisaged because they are not adapted to modifications of the model structure, which is the point (...) of interest. For these reasons, we proposed a new approach of automatic search for model. The program consists of four independent connected modules : The generator produces model, based on the rationale of formal grammars. Protocol and experimental data are stored in a set of experiments. The simulator using a protocol and a model provides simulated results. Finally, the supervisor by comparing simulated results and experimental data, adapts the model parameters to increase their fit and either chooses a new experiment to explore, or modifies the model structure. Change of the model structure is performed among still unexplored models according to their promise level, which is iteratively evaluated relatively to previously explored models through a proposed model distance. The generator is written in Prolog and the other modules in C++. The architecture of the program allows us to modify or complete a module without changing anything in the other modules. As a consequence, the proposed modeling approach conceived to study T lymphocyte differentiation within the thymus remains independent of this biological phenomenon and can be applied to other biological problems. (shrink)

Most models of lexical access assume that bilingual speakers activate their two languages even when they are in a context in which only one language is used. A critical piece of evidence used to support this notion is the observation that a given word automatically activates its translation equivalent in the other language. Here, we argue that these findings are compatible with a different account, in which bilinguals “carry over” the structure of their native language to the non-native language during (...) learning, and where there is no activation of translation equivalents. To demonstrate this, we describe a model in which language learning involves mapping native language phonological relationships to the non-native language, and we show how it can explain the results attributed to automatic activation of translation equivalents. (shrink)

We investigated the automaticity of implicit sequence learning by varying perceptual load in a pure perceptual sequence learning paradigm. Participants responded to the randomly changing identity of a target, while the irrelevant target location was structured. In Experiment 1, the target was presented under low or high perceptual load during training, whereas testing occurred without load. Unexpectedly, no sequence learning was observed. In Experiment 2, perceptual load was introduced during the test phase to determine whether load is required to express (...) perceptual knowledge. Learning itself was unaffected by visuospatial demands, but more learning was expressed under high load test conditions. In Experiment 3, we demonstrated that perceptual load is not required for the acquisition of perceptual sequence knowledge. These findings suggest that perceptual load does not mediate the perceptual sequence learning process itself, supporting the automaticity of implicit learning, but is mandatory for the expression of pure perceptual sequence knowledge. (shrink)

The main result of this paper states that the isomorphism problem for ω-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalbán, and Nies showing that the isomorphism problem for ω-automatic structures is not in . Moreover, assuming the continuum hypothesis CH, we can show that the isomorphism problem for ω-automatic trees of finite height is recursively equivalent with second-order arithmetic. (...) On the way to our main results, we show lower and upper bounds for the isomorphism problem for ω-automatic trees of every finite height: It is decidable , for height 1 , -hard and in for height 3, and - and -hard and in for height . All proofs are elementary and do not rely on theorems from set theory. (shrink)

We investigate structures recognizable by finite state automata with an input tape of length a limit ordinal. At limits, the set of states which appear unboundedly often before the limit are mapped to a limit state. We describe a method for proving non-automaticity and apply this to determine the optimal bounds for the ranks of linear orders recognized by such automata.

Background and ObjectivesFocal cortical dysplasia is a type of malformations of cortical development and one of the leading causes of drug-resistant epilepsy. Postoperative results improve the diagnosis of lesions on structural MRIs. Advances in quantitative algorithms have increased the identification of FCD lesions. However, due to significant differences in size, shape, and location of the lesion in different patients and a big deal of time for the objective diagnosis of lesion as well as the dependence of individual interpretation, sensitive approaches (...) are required to address the challenge of lesion diagnosis. In this research, a FCD computer-aided diagnostic system to improve existing methods is presented.MethodsMagnetic resonance imaging data were collected from 58 participants. Morphological and intensity-based features were calculated for each cortical surface and inserted into an artificial neural network. Statistical examinations evaluated classifier efficiency.ResultsNeural network evaluation metrics—sensitivity, specificity, and accuracy—were 96.7, 100, and 98.6%, respectively. Furthermore, the accuracy of the classifier for the detection of the lobe and hemisphere of the brain, where the FCD lesion is located, was 84.2 and 77.3%, respectively.ConclusionAnalyzing surface-based features by automated machine learning can give a quantitative and objective diagnosis of FCD lesions in presurgical assessment and improve postsurgical outcomes. (shrink)

Resources of professional companies operating on the medical services market contain data from a huge number of transactional documents. This allows them to collect and process, among other actions, information about medical products. Organized data is obviously more valuable. In this paper, the possibility of supporting the process of organizing information is considered, with the goal to extract values of attributes of medical products from brief descriptions in transactional documents. This helps to build a structured product specification and makes it (...) possible to make comparisons between products. For this purpose, an approach based on regular expressions and their generation with the use of the genetic algorithm is proposed. The results presented in the paper show a great potential of the presented method. (shrink)

This study explains why conflict often appears delayed and then escalates abruptly by redefining its core mechanism. Conflict is not the direct result of misalignment, but the cumulative outcome of transition failure. Existing approaches—focusing on conflict avoidance, communication deficits, or emotion regulation—do not sufficiently explain why individuals recognize misalignment yet fail to translate it into action. This study introduces transition as an independent process between recognition and action. Transition refers to the process by which recognized misalignment is converted into an (...) actionable form within a relational context. It does not occur automatically, but only when specific conditions are satisfied. This study models transition as a multi-variable gating structure, in which relational cost, emotional overload, the meta–expression gap, and social inhibition determine whether transition is enabled or blocked. When transition repeatedly fails, misalignment is not resolved but maintained in a suppression state and accumulates over time. This accumulation is not linear, but evolves qualitatively through memory reactivation and the reinforcement of interpretive structures. Once a threshold is exceeded, a state transition occurs. At this point, conflict does not gradually intensify, but emerges through nonlinear activation, shifting from a suppressed state to an unstable activation state. Furthermore, repeated transition failure leads to a disengagement state in which attempts at transition are no longer initiated. This state does not indicate the absence of conflict, but rather its structural delay. Under certain conditions, accumulated misalignment is activated simultaneously, producing abrupt and intensified conflict. This study reconceptualizes conflict as the result of accumulated transition failure rather than immediate misalignment. It shifts the analytical focus from post-expression outcomes to the pre-transition structure, providing a condition-based state transition framework for understanding the emergence of conflict. (shrink)

Due to existence of a huge amount of textual data either on the World Wide Web or in textual databases like PubMed, the development of novel automatic keyphrase extraction methods has emerged as one of the key research problems in recent past. Consequently, a number of machine learning techniques, mostly supervised, have been proposed to extract keyphrases from text documents. But, one of the main bottlenecks that hinders the success of such systems is the requirement of annotated corpora for (...) training purpose. In this paper, we propose the design of a deep text mining system to identify keyphrases in text documents that are either unstructured or semi-structured in nature. The novelty of our system lies in its applicability on a single document, instead of demanding a collection of annotated texts for training, to identify keyphrases embedded within it. The proposed system applies parsing techniques to identify candidate phrases. After mapping the original set of candidate phrases into a low-dimensional space using Singular Value Decomposition, the Markov Clustering technique is applied to cluster related sentences together. Finally, considering each cluster as a document, Latent Dirichlet Allocation is applied to identify feasible keyphrases that are presented to users in non-increasing order of their relevance score values. The efficacy of the proposed system is established through experimentation on datasets from two different domains. On comparative evaluation, we found that the proposed system outperforms KEA and KEA that apply the supervised machine learning approach for automatic keyphrase extraction from text documents. (shrink)

The paper presents a cross-country analysis of the second generation of currency boards introduced in three East European countries: Bulgaria, Estonia and Lithuania. We focus on their institutional, legal and political characteristics which are closely associated with the operation of the automatic mechanism of currency boards. The presence of an automatic mechanism within the framework of the currency board is often cited as a major counterpoint to the “discretion and subjectivity” of a classical central bank. Since there is (...) no precise definition of automatic mechanisms in the literature, we define it as: “the presence of a positive cointegration relationship between the balance of payments and the reserve money and absence of discretionary variables in the model.” When discretionary variables are present in the model in one form or another, we may speak of a “mechanism for adjustment through discretion – conscious or unconscious.” Within the framework of the second generation of currency boards, we reduce the channel of discretion to the presence of atypical balance sheet items and employment of a number of monetary policy instruments. We seek in this article to compare currency board automatic mechanism in Bulgaria, Estonia and Lithuania.L’article procède d’une analyse transversale par pays de la deuxième génération des “bureaux d’émission” introduits dans trois pays de l’Europe de l’Est. L’accent est mis sur les caractéristiques institutionnelles, juridiques et politiques qui sont étroitement associées à l’opération du mécanisme automatique des bureaux d’émission. L’existence d’un mécanisme automatique dans la structure d’un bureau d’émission est souvent mise en avant comme l’argument majeur à l’encontre de la “discrétion” et la “subjectivité” d’une banque centrale classique. Parce qu’il n’existe aucune définition précise du mécanisme automatique dans la littérature, nous la définissons comme “la présence d’une relation positive de cointégration entre la balance des paiements et les réserves monétaires et l’absence de variables discrétionna- ires dans le modèle”. Quand des variables discrétionnaires sont présentes dans le modèle sous une forme ou une autre, nous pouvons parler d’un “mécanisme d’ajustement discrétionnaire – conscient ou inconscient”. Au sein de la structure de la deuxième génération des bureaux d’émission, la discrétion se réduit à la présence de postes atypiques dans le bilan et à l’emploi d’un certain nombre d’instruments de politique monétaire.L’article propose une comparaison du mécanisme automatique en Bulgarie, Estonie et Lithuanie. (shrink)

This essay continues the philosophical synthesis developed in Reality as a Structured Process. Part I argued that reality is not exhausted by factual actuality, but must be understood as a structured open process in which actuality emerges from potentiality without eliminating it. The present essay examines how this structured openness becomes accessible, centered, experienced, and interpreted. The argument unfolds in four steps. First, the distinction between observable and non-observable structure is interpreted epistemically rather than ontologically. What becomes measurable is not (...) opposed to the real, but represents a finite mode of disclosure within a richer physical organization. Second, consciousness is understood neither as a universal property of all things nor as a miraculous emergence from pure exteriority. It arises where openness, selective stabilization, resonance, integration, self-reference, and centering generate a stable inner domain. Third, the essay distinguishes between pre-subjective openness, pre-phenomenal subjectivability, and phenomenality. Reality may be intrinsically open to the emergence of experience without already being experiential in its most basic structure; yet this openness becomes relevant to consciousness only insofar as it can be organized, under specific conditions, as an inner perspective. This allows for a non-reductive account of consciousness that avoids both reductive physicalism and classical panpsychism. Finally, the essay turns to meditative, nondual, and spiritual experience. Such experiences may be profound, transformative, and therapeutically significant, yet they do not by themselves establish a final metaphysical ontology. The structure of an experience is not automatically the structure of reality. A responsible philosophy of consciousness must therefore distinguish experience, interpretation, ontology, usefulness, and epistemic authority. The result is an open realism in which observability, consciousness, healing, and spiritual meaning appear as modes of disclosure within the space of possibilities, without reducing reality to factuality or inflating experience into metaphysical certainty. (shrink)

This chapter applies the structure of action to understanding what is called implicit bias but which is reconceptualized as automatic bias. Specifically, since attention guides action, attention biases action toward specific targets, and the outcome can be positively, negatively, or neutrally biased behavior. The concept of a bias as a basis for solving the Selection Problem is revealed as a driver of biased behavior through biased attention. These automatic biases have disparate sources. Positive biases in medical attention as (...) seen in radiologists is described, revealing how excellence in learning sets biases that shift a novice toward expertise. Negative biases in vision and memory that have negative social consequences are explained through biased attention due to inadequate upbringing (learning). Some proposals regarding how we might better understand automatic bias so as to mitigate them are explored. (shrink)

In argument mining research, educational texts such as student essays have been a popular target genre from the beginning. The annotated corpora available so far, however, focus on essays written by older (or adult) students with relatively high proficiency levels. In our work, we expand the range of texts to German essays by school students in grade 9, which display very different qualities on all levels of analysis. We show that a common approach to representing argument structure as trees is (...) not sufficient to capture the constellations of argument components in those essays, and we propose a suitable extension of that scheme, which we applied to an initial corpus of 50 essays. Furthermore, we conducted experiments with large language models on a fine-grained version of the argument component type classification task and show that medium-sized open-source models can achieve promising classification results using only two labeled essays in a few-shot prompting approach. (shrink)

Following our previous work establishing that complex structure does not automatically emerge from SK combinatory logic, we investigate whether reversible computation provides the missing ingredient for quantum structure. Through systematic analysis of four computational models—reversible logic gates (Toffoli, Fredkin), continuous-time quantum walks, reversible cellular automata, and the non-commutativity of SK operators—we establish a hierarchy of quantum-like behaviors: Level 0 (Irreversible): SK computation—classical, deterministic Level 1 (Discrete Reversible): Toffoli/Fredkin gates, RCA—classical, embeddable in Sp(2N,R) where N = 2^n for n-bit gates Level (...) 2 (Continuous-Time): U(t) = exp(-iHt) evolution—interference emerges (note: i is introduced by hand) Level 3 (Quantum): Quantum circuits—superposition, entanglement Our main finding is that reversibility alone is insufficient for quantum behavior: discrete reversible gates on n bits are 2^n × 2^n permutation matrices that embed into the classical symplectic group Sp(2·2^n,R), not the unitary group U(2^n). While continuous-time evolution introduces interference patterns, it does not generate genuine superposition. We conclude that quantum structure requires additional axioms beyond any form of computation, discrete or continuous. (shrink)

Theories of intentional action have by and large omitted discussion of the psychological processes by which intentional actions are brought about. As a much-needed corrective, Wu (2023) offers one of the most plausible psychological theories of the nature and structure of action on offer, one that vindicates the central role of attention and its interplay with intentions and other forms of priority-setting. The theory of action that Wu develops is especially philosophically interesting because it purports to address some central foundational (...) questions in action theory: the distinction between agentive and nonagentive behaviour, the puzzle of control and automaticity, the problem of deviant causal chains, the nature of intentions, the role of non-intentional biases, and the nature of mental actions and reasoning. As a result, the book develops an ambitious action theory that is both extremely well-informed empirically and philosophically cogent. My comments focus on one aspect of Wu’s view: his proposed distinction between agentive and nonagentive behaviour and the role it plays within his overall picture. A remarkable aspect of Wu’s project is that it aims to dethrone intentions from their central role in demarcating agentive from nonagentive behaviour. In their place, Wu assigns the demarcating role to attention-involving guidance: action, in his view, is a matter of solving a Selection Problem through the input-guided exercise of action capacities. Wu offers extremely interesting and powerful arguments for this position. I will discuss this idea, raise some questions about it, and consider possible responses to Wu’s main arguments. My central question, in a nutshell, is whether attention-guided selection can demarcate action from mere happening when attention itself responds to non-intentional biases, especially in cases where those biases come apart from the agent’s explicit or implicit goals and intentions. I will end by suggesting that Wu’s outstanding contributions could also be profitably incorporated within a theory of action that does not depart quite as radically from a more traditional picture of agency. In doing so, I hope to convey how innovative and worth engaging with Wu’s radical proposal is. (shrink)

The field of computational law has increasingly moved into the focus of the scientific community, with recent research analysing its issues and risks. In this article, we seek to draw a structured and comprehensive list of societal issues that the deployment of automatically processable regulation could entail. We do this by systematically exploring attributes of the law that are being challenged through its encoding and by taking stock of what issues current projects in this field raise. This article adds to (...) the current literature not only by providing a needed framework to structure arising issues of computational law but also by bridging the gap between theoretical literature and practical implementation. Key findings of this article are: (1) The primary benefit (efficiency vs. accessibility) sought after when encoding law matters with respect to the issues such an endeavor triggers; (2) Specific characteristics of a project—project type, degree of mediation by computers, and potential for divergence of interests—each impact the overall number of societal issues arising from the implementation of automatically processable regulation. (shrink)

The 2008 bailout is often taken as evidence of the domination of the US political system by large financial institutions. In fact, the bailout demonstrated the vulnerability of US banks to government pressure. Large banks in the United States could not defy regulators, because their future income depended on the US market. In Britain, by contrast, one bank succeeded in scuttling the preferred governmental solution of an industry-wide recapitalization, because most of its revenue came from outside the United Kingdom. This (...) was an exercise of structural power, but one that most contemporary scholarship on business power ignores or misclassifies, since it limits structural power to the automatic adjustment of policy to the possibility of disinvestment. We show that structural power can be exercised strategically, that it is distinct from instrumental power based on lobbying, and that it explains consequential variations in bailout design in the United Kingdom, the United States, France, and Germany. (shrink)

The contents and structure of semantic memory have been the focus of much recent research, with major advances in the development of distributional models, which use word co‐occurrence information as a window into the semantics of language. In parallel, connectionist modeling has extended our knowledge of the processes engaged in semantic activation. However, these two lines of investigation have rarely been brought together. Here, we describe a processing model based on distributional semantics in which activation spreads throughout a semantic network, (...) as dictated by the patterns of semantic similarity between words. We show that the activation profile of the network, measured at various time points, can successfully account for response times in lexical and semantic decision tasks, as well as for subjective concreteness and imageability ratings. We also show that the dynamics of the network is predictive of performance in relational semantic tasks, such as similarity/relatedness rating. Our results indicate that bringing together distributional semantic networks and spreading of activation provides a good fit to both automatic lexical processing (as indexed by lexical and semantic decisions) as well as more deliberate processing (as indexed by ratings), above and beyond what has been reported for previous models that take into account only similarity resulting from network structure. (shrink)

A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.

[Version 6: An Computational Appendix have been added. ] [Version 5: An appendix and a table of supported discrete models of quantum gravity have been added. ] -/- Theorem on the Absence of Automatic Linear Dispersion from Discreteness + No Boost Lemma + Observational signature + table of supported theories. This theorem and lemma eliminate two mathematical obstacles often associated with discrete approaches to quantum gravity -/- Discrete models of spacetime are often assumed to generically predict a first-order, energy-dependent (...) (linear-in-E) Lorentz-violating dispersion of high-energy photons, of the kind tightly constrained by gamma-ray burst (GRB) timing observations. We show that this implication does not follow from discreteness alone: it requires an additional, independent structural assumption - namely, that local phase contributions accumulated along propagation are coherently aligned with a fixed, globally preferred frame. In any discrete substrate where the physical metric is emergent and reconstructed (rather than given by a fixed embedding), and where local phase contributions are not long-range correlated, the accumulated phase grows only as the square root of the number of traversed elements, suppressing any linear dispersion signal. This result is structural and substrate-independent: it applies to any discrete model satisfying the stated decorrelation property, and is intended as a general consistency tool for the broader class of emergent-geometry approaches to quantum gravity, not as evidence for any specific model. The theorem does not exclude Lorentz-violating dispersion in all discrete spacetime models; it proves that discreteness alone is insufficient to derive a universal linear dispersion law. The theorem formalizes a necessary-condition requirement: linear Lorentz-violating dispersion is not a generic consequence of discreteness, but requires additional assumptions about microscopic phase coherence. (shrink)

This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal geometry of “k-automatic” sets, subsets of $[0,1]^d$ that are recognized by Büchi automata. The primary tools for building this characterization include the entropy of a regular language and the digraph structure of an automaton. Via an analysis of the strongly connected components of such (...) a structure, we give an algorithmic description of the box-counting dimension, Hausdorff dimension, and Hausdorff measure of the corresponding subset of the unit box. Applications to definability in model-theoretic expansions of the real additive group are laid out as well. (shrink)

Available from UMI in association with The British Library. ;This thesis investigates the application of the theory of Conceptual Structures to an Experience Base model, which is a question-answering system for a knowledge base of pseudo-natural language statements of everyday experience. This thesis progresses to extend the fundamental principles carried from the experience base, to develop a framework for Reasoning by Analogy. Both methodologies are implemented, and uncertainty in the models is handled using the theory of Support Logic. ;Incompleteness (...) of information, uncertainty of data and the need for a definite structure to the way in which rules and data interact, are aspects which must be dealt with if the experience base is to succeed. One more aspect is the knowledge representation which dictates the ease with which processing may be performed upon it. Conceptual graphs are used to store information used by an Experience Base. Control of the reasoning is effected by plausible inference reinforced by the theory of Support Logic for handling uncertainty. The knowledge base is a set of initially completely disparate islands of knowledge, which the system automatically clusters into coherent groups in an associative network. ;The principles evolved from research into experience bases lead to the conception, development and implementation of a computational framework for Analogical Reasoning. The reasoning is performed between domains of knowledge rather than within a single domain as in case-based reasoning, and operates on pseudo-natural language statements as for the experience base. It relies on relation-based structure mapping and includes a sophisticated mechanism for translating between the new problem and the analogue. The strong connection between this work and metaphor interpretation is also investigated, together with ideas on how to negotiate with the apparent multitude of types of analogical reasoning. (shrink)

The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with him.} (Karttunen 1976), in particular of the fact that the indefinite in the initial sentence can have wide or narrow scope, but the first discourse as a whole allows only for the wide scope reading, while the second discourse allows for both readings. The cross-sentential interaction between scope and anaphora is captured (...) in terms of structured anaphora to quantifier domains, formalized in a new dynamic system couched in classical type logic; given the underlying type logic, Montague-style compositionality at sub-clausal level follows automatically. Modal subordination (Roberts 1987) is analyzed in a parallel way, thereby capturing the parallels between the individual and modal domains argued for in Stone (1999). Several other phenomena are analyzed in terms of structured anaphora: exceptional wide scope, weak / strong donkey readings, anaphoric / uniqueness-implying definite descriptions and interactions between same / different and quantifier scope. (shrink)

The process of assessing executive functions through behavioral observation scales is still under theoretical and empirical construction. This article reports on the analysis of the factorial structure of the EOCL-1 scale that assesses executive functions, as proposed by the theory developed by Luria, which has not been previously considered in this type of evaluation. In this scale, the executive functions taken into account are error correction, internal behavioral and cognition regulatory language, limbic system conscious regulation, decision making, future consideration of (...) consequences of actions, goal-directed behavior, inhibitory control of automatic responses, creation of new behavioral repertoires, and cognitive–behavioral activity verification. A variety of validity and reliability analyses were carried out, with the following results: an adequate internal consistency level of executive functions between α = 0.70 and α = 0.83, significant convergent validity with a scale that assesses frontal deficits between r = −0.07 and r = 0.28, and the scale’s construct validity that proposes a model with an executive central factor comparative fit index = 0.93, root mean square error of approximation = 0.04, standardized root mean square residual = 0.04, and x2 = 789.29, p = 0.001. The findings are discussed based on previous literature reports and in terms of the benefits of using a scale to assess the proposed executive functions. (shrink)

In the chemical production process, the temperature of the continuous reactor has nonlinear characteristics such as large inertia. An improved autodisturbance control method is proposed. By improving the tracking differentiator with adjustable parameters, the expanded state observer and the control structure obtained an improved automatic disturbance rejection control model and realized the optimal control of the nonlinear and large-delay systems. On the process control training system, the experiment of the continuous system process flow is compared with the anti-interference of (...) the Smith predictive compensation system, which uses an optimal set of data. The reactor temperature fluctuates, but the self-resistance is improved. The optimal overshoot of the disturbance is close to 0. Compared with the original antidisturbance controller, the antidisturbance time is not affected by the number of iterations, which reduces the high requirements on the accuracy of the parameters. Therefore, the improved automatic disturbance rejection control improves the operation and enhances the ability to resist external disturbance that changes the controlled object. (shrink)

In an increasingly data-driven world, the question of data – or metadata – veracity is now a central issue not only in the world of information but also in the legal one. Data veracity describes a closeness to truth on a higher level than a measure such as accuracy does. High veracity data is data that can be relied upon when making decisions, thus reducing the risk of basing choices on untrue information. The article uses epistemic logic to model structured (...) metadata automatically extracted from legal papers, and the tools of metaontology to propose a definition of veracity as truthmaker. (shrink)

We investigate whether complex number structure, fundamental to quantum mechanics, can be derived from SK combinatory logic—a minimal, Turing-complete computational system. Through systematic exploration of four distinct approaches (Sorkin's quantum measure theory, algebraic structure of reduction operators, path space holonomy, and information-theoretic derivation), we find that complex structure does not automatically emerge from SK computation. While we discovered that phase differences can be computed from information-theoretic quantities (specifically, the difference in S-reduction counts between paths), the choice of computation formula remains (...) arbitrary. This constitutes a negative result with significant implications: it establishes constraints on the relationship between computational substrates and quantum structure, clarifying what additional assumptions are necessary to bridge the gap between computation and quantum mechanics. (shrink)