Results 91 to 100 of about 132,919 (197)
Exploring the symbol processing 'time interval' parametric constraint in a Belousov-Zhabotinsky operated chemical Turing machine. [PDF]
RSC Adv, 2021 Draper TC +2 more
europepmc +1 more source
Automation and Augmentation in Theological Perspective
Modern Theology, EarlyView.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
Turing Impossibility Properties for Stack Machine Programming
, 2012 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
Noûs, EarlyView.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
About Shannon's problem for turing machines [PDF]
Computer Science Journal of Moldova, 1993 Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
Yu. Rogozhin
doaj
Noûs, EarlyView.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
Quantum Random Self-Modifiable Computation
, 2019 Among the fundamental questions in computer science, at least two have a deep impact on mathematics. What can computation compute? How many steps does a computation require to solve an instance of the 3-SAT problem? Our work addresses the first question,
Fiske, Michael Stephen
core
Philosophical Issues, EarlyView.ABSTRACT This essay asks a new question: When someone with a firm understanding of basic operations nevertheless remains ignorant of a complex logical or mathematical truth, precisely what kind of information are they missing? I introduce “catenary truths,” a significant component of this non‐omniscient shortfall.
Michael G. Titelbaum
wiley +1 more source
Renaissance Studies, EarlyView.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
The Turing Test as a Sceptical Scenario
Theoria, EarlyView.ABSTRACT The Turing test is usually seen as an operationalisation of the question whether machines can think. In this paper, my aim is to show that by understanding the test in this way, one ends up in scepticism about the existence of minds in general. By focusing on whether some particular machine can pass the test, or whether it can be said to be an
Marvin Tritschler
wiley +1 more source