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
Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI
Proceedings, 2020 The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc.
Rao Mikkilineni
doaj +1 more source
Evolving MultiAlgebras unify all usual sequential computation models [PDF]
, 2010 It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not ...
Grigorieff, Serge, Valarcher, Pierre
core +6 more sources
Nature as a Network of Morphological Infocomputational Processes for Cognitive Agents [PDF]
, 2017 This paper presents a view of nature as a network of infocomputational agents organized in a dynamical hierarchy of levels. It provides a framework for unification of currently disparate understandings of natural, formal, technical, behavioral and social
Dodig Crnkovic, Gordana
core +2 more sources
Reachability for infinite time Turing machines with long tapes [PDF]
, 2020 Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells cannot be halting
Carl, Merlin +2 more
core +6 more sources
Learning, Social Intelligence and the Turing Test - why an "out-of-the-box" Turing Machine will not pass the Turing Test [PDF]
, 2012 The Turing Test (TT) checks for human intelligence, rather than any putative general intelligence. It involves repeated interaction requiring learning in the form of adaption to the human conversation partner.
A. Trewavas +13 more
core +2 more sources
Cinnamons: A Computation Model Underlying Control Network Programming
, 2017 We give the easily recognizable name "cinnamon" and "cinnamon programming" to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP).
Kratchanov, Kostadin
core +1 more source
Towards a Church-Turing-Thesis for Infinitary Computations [PDF]
, 2013 We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability and build a canonical model, called Idealized Agent Machines ($IAM$s) of ...
Carl, Merlin
core
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
, 2016 We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
Philosophy of Computer Science: An Introductory Course [PDF]
, 2005 There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title.
Rapaport, William J.
core