In modern theories of rewriting structures, hyper-sentential and hyper-algebraic extensions of languages-families have abstracted the imminent features of iterated parallel substitution. After introducing the concept ...
Motivated by an elementary programming system for formal language generation, we propose a generalized pushdown acceptor which uses both a checking stack and a pushdown store in original manner. In the analysis of the...
详细信息
Finite state machines with feedback present a novel machine model when considered under the scenario of cognitive computations. The model is designed in the spirit of automata theory and presents a mix of Alan Turing&...
详细信息
ISBN:
(纸本)9783030229962;9783030229955
Finite state machines with feedback present a novel machine model when considered under the scenario of cognitive computations. The model is designed in the spirit of automata theory and presents a mix of Alan Turing's finite state machines and Norbert Wiener's machines with feedback. For the model we define, what we call, minimal machine consciousness and machine qualia. The design of our model is lead by natural engineering requirements. Its properties are justified by the latest findings in neuroscience and by ideas from the classical literature of the philosophy of mind. For the model a test distinguishing minimally conscious machines from unconscious ones ("zombies") on a given cognitive task is proposed. Our modeling supports the claim that consciousness is a computational phenomenon that is not just a matter of suitable software but also requires a dedicated architecture.
The Extended Church-Turing Thesis (ECTT) posits that all effective information processing, including unbounded and non-uniform interactive computations, can be described in terms of interactive Turing machines with ad...
详细信息
The Extended Church-Turing Thesis (ECTT) posits that all effective information processing, including unbounded and non-uniform interactive computations, can be described in terms of interactive Turing machines with advice. Does this assertion also apply to the abilities of contemporary large language models (LLMs)? From a broader perspective, this question calls for an investigation of the computational power of LLMs by the classical means of computability and computational complexity theory, especially the theory of automata. Along these lines, we establish a number of fundamental results. Firstly, we argue that any fixed (non-adaptive) LLM is computationally equivalent to a, possibly very large, deterministic finite-state transducer. This characterizes the base level of LLMs. We extend this to a key result concerning the simulation of space-bounded Turing machines by LLMs. Secondly, we show that lineages of evolving LLMs are computationally equivalent to interactive Turing machines with advice. The latter finding confirms the validity of the ECTT for lineages of LLMs. From a computability viewpoint, it also suggests that lineages of LLMs possess super-Turing computational power. Consequently, in our computational model knowledge generation is in general a non-algorithmic process realized by lineages of LLMs. Finally, we discuss the merits of our findings in the broader context of several related disciplines and philosophies.
Traditionally, computations are seen as processes that transform information. Definitions of computation subsequently concentrate on a description of the mechanisms that lead to such processes. The bottleneck of this ...
详细信息
ISBN:
(纸本)9783662460788;9783662460771
Traditionally, computations are seen as processes that transform information. Definitions of computation subsequently concentrate on a description of the mechanisms that lead to such processes. The bottleneck of this approach is twofold. First, it leads to a definition of computation that is too broad and that precludes a separation of entities that, according to prevailing opinions, do perform computation from those which don't. Secondly, it also leads to a 'machine-dependent' notion of computation, complicating the identification of computational processes. We present an alternative view of computation, viz. that of a knowledge generating process. From this viewpoint, computations create knowledge within the framework of 'more or less' formalized epistemic theories. This new perception of computation allows to concentrate upon the meaning of computations - what they do for their designers or users. It also enables one to see the existing development of computers and information technologies in a completely new perspective. It permits the extrapolation of the future of computing towards knowledge generation and accumulation, and the creative exploitation thereof in all areas of life and science. The flux of our ideas on computation bring challenging new problems to the respective research, with wide connotations in the field of artificial intelligence, in cognitive sciences, and in philosophy, epistemology and methodology of science.
Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise model...
详细信息
ISBN:
(纸本)9783540694052
Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise models of computation that capture the notion of computing as seen today and that could play the same role as Turing machines did for the classical case? We propose two models inspired from key mechanisms of current systems in both artificial and natural environments: evolving automata and interactive Turing machines with advice. The two models represent relevant adjustments in our apprehension of computing: the shift to potentially non-terminating interactive computations, the shift towards systems whose hardware and/or software can change over time, and the shift to computing systems that evolve in an unpredictable, non-uniform way. The two models are shown to be equivalent and both are provably computationally more powerful than the models covered by the old computing paradigm. The models also motivate the extension of classical complexity theory by non-uniform classes, using the computational resources that are natural to these models. Of course, the additional computational power of the models cannot in general be meaningfully exploited in concrete goal-oriented computations.
Incidents like the crash of Lion Air Flight 610 in 2018 challenge the design of reliable and secure cyber-physical systems that operate in the real-world and have to cope with unpredictable external phenomena and erro...
详细信息
ISBN:
(纸本)9783030677305;9783030677312
Incidents like the crash of Lion Air Flight 610 in 2018 challenge the design of reliable and secure cyber-physical systems that operate in the real-world and have to cope with unpredictable external phenomena and error-prone technology. We argue that their design needs to guarantee minimal machine consciousness, which expresses that these systems must operate with full awareness of (the state of) their components and the environment. The concept emerged from our recent effort to develop a computational model for conscious behavior in robots, based on the theory of automata. Making systems `minimal machine conscious' leads to more trustworthy systems, as it strengthens their behavioral flexibility in varying environments and their resilience to operation and cooperation failures of their components and as a whole. The notion of minimal machine consciousness has the potential to become one of the defining attributes of Industry 4.0.
暂无评论