Results 111 to 120 of about 2,960,567 (255)
Fractal Dimension versus Process Complexity
We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machine τ and any particular input x, we consider what we call the space-time diagram which is basically the ...
Joost J. Joosten +2 more
doaj +1 more source
Exploring the symbol processing 'time interval' parametric constraint in a Belousov-Zhabotinsky operated chemical Turing machine. [PDF]
Draper TC +2 more
europepmc +1 more source
Automation and Augmentation in Theological Perspective
Abstract AI enables forms of automation that threaten unemployment and deskilling, eliminating important opportunities for the development of virtue. The concomitant loss of virtue and meaningful employment makes it a theological problem from the perspective of Catholic social teaching and theological anthropology.
Paul Scherz
wiley +1 more source
The group of reversible turing machines: subgroups, generators, and computability
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state.
Sebastian Barbieri +2 more
doaj +1 more source
ABSTRACT How should we understand the duration of a pleasant or unpleasant sensation, insofar as its duration modulates how good or bad the experience is overall? Given that we seem able to distinguish between subjective and objective duration and that how well or badly someone's life goes is naturally thought of as something to be assessed from her ...
Andreas L. Mogensen
wiley +1 more source
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
About Shannon's problem for turing machines [PDF]
Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
Yu. Rogozhin
doaj
Personnel Psychology's 40 Questions Series: Artificial Intelligence
ABSTRACT In this article, we present a curated set of 40 questions on Artificial Intelligence (AI) to address its rapidly evolving role in Industrial/Organizational (I/O) Psychology, Human Resources (HR), and Organizational Behavior (OB) research and practice. We solicited questions from our professional networks and organized the responses into themes:
Emily D. Campion, Scott Tonidandel
wiley +1 more source
Turing Impossibility Properties for Stack Machine Programming
The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing
Bergstra, J. A., Middelburg, C. A.
core +1 more source
ABSTRACT During the fifteenth and sixteenth centuries, there was no statutory difference between cartography, drawing and painting. These activities were performed then by craftsmen who were part of a vast group under the umbrella of ‘mechanical arts’ and fell under the ‘artifex’ category. Artifex were experts in any particular art, whether a craftsman,
Vasco Medeiros
wiley +1 more source

