Results 1 to 10 of about 674,428 (75)
Mind as Machine: The Influence of Mechanism on the Conceptual Foundations of the Computer Metaphor
RUDN Journal of Philosophy, 2022 This article will focus on the mechanistic origins of the computer metaphor, which forms the conceptual framework for the methodology of the cognitive sciences, some areas of artificial intelligence and the philosophy of mind.
Pavel N. Baryshnikov
doaj +1 more source
Moschovakis Extension of Represented Spaces [PDF]
Logical Methods in Computer Science, 2019 Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric spaces).
Dimiter Skordev
doaj +1 more source
A Swiss Pocket Knife for Computability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and constructions, but with new criteria for success that are natural from a ...
Neil D. Jones
doaj +1 more source
Computability of 1-manifolds [PDF]
Logical Methods in Computer Science, 2014 A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable.
Konrad Burnik, Zvonko Iljazovic
doaj +1 more source
A Note on the Reality of Incomputable Real Numbers and Its Systemic Significance
Systems, 2021 We discuss mathematical and physical arguments contrasting continuous and discrete, limitless discretization as arbitrary granularity. In this regard, we focus on Incomputable (lacking an algorithm that computes in finite time) Real Numbers (IRNs).
Gianfranco Minati
doaj +1 more source
Computability of Data-Word Transductions over Different Data Domains [PDF]
Logical Methods in Computer Science, 2022 In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can produce the ...
Léo Exibard +3 more
doaj +1 more source
The Computational and Pragmatic Approach to the Dynamics of Science [PDF]
Filozofia i Nauka, 2020 Science means here mathematics and those empirical disciplines which avail themselves of mathematical models. The pragmatic approach is conceived in Karl R. Popper’s The Logic of Scientific Discovery (p.
Witold Marciszewski
doaj +1 more source
On the system CL12 of computability logic [PDF]
Logical Methods in Computer Science, 2015 Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.
Giorgi Japaridze
doaj +1 more source
Freezing, Bounded-Change and Convergent Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes a bounded ...
Nicolas Ollinger, Guillaume Theyssier
doaj +1 more source
Representations of measurable sets in computable measure theory [PDF]
Logical Methods in Computer Science, 2014 This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly countably ...
Klaus Weihrauch +1 more
doaj +1 more source