Results 1 to 10 of about 3,053,426 (341)
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 +3 more sources
The computability path ordering [PDF]
Logical Methods in Computer Science, 2015 This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a ...
Frédéric Blanqui +2 more
doaj +3 more sources
Computability of Optimizers [PDF]
IEEE Transactions on Information Theory, 2023 Optimization problems are a staple of today’s scientific and technical landscape. However, at present, solvers of such problems are almost exclusively run on digital hardware. Using Turing machines as a mathematical model for any type of digital hardware,
Yunseok Lee, H. Boche, Gitta Kutyniok
semanticscholar +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
Computational Psychiatry for Computers [PDF]
iScience, 2020 Computational psychiatry is a nascent field that attempts to use multi-level analyses of the underlying computational problems that we face in navigating a complex, uncertain and changing world to illuminate mental dysfunction and disease. Two particular foci of the field are the costs and benefits of environmental adaptivity and the danger and ...
Eric Schulz, Peter Dayan
openaire +4 more sources
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
Computability of topological pressure on compact shift spaces beyond finite type [PDF]
Nonlinearity, 2020 We investigate the computability (in the sense of computable analysis) of the topological pressure P top(ϕ) on compact shift spaces X for continuous potentials ϕ:X→R .
M. Burr +3 more
semanticscholar +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 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