Results 21 to 30 of about 29,886 (270)
Language Development Research, 2022 The logical problem of language acquisition has been at the forefront of psycholinguistics and behavioral neuroscience for decades. One of the most influential answers to the problem of how successful acquisition occurs on the basis of noisy input ...
Elliot Murphy, Evelina Leivada
doaj +2 more sources
Philosophies, 2023 The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that ...
Nathan Salmon
doaj +1 more source
Program Algebra for Turing-Machine Programs
Scientific Annals of Computer Science, 2019 This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and ...
Jan A. Bergstra, Cornelius A. Middelburg
doaj +1 more source
A Topological Characterization to Arbitrary Resilient Asynchronous Complexity
Mathematics, 2022 In this work, we extend the topology-based framework and method for the quantification and classification of general resilient asynchronous complexity.
Yunguang Yue +3 more
doaj +1 more source
Computability of simple games: A complete investigation of the sixty-four possibilities [PDF]
, 2011 Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and ...
Al-Najjar +19 more
core +2 more sources
Introduction to clarithmetic II
, 2013 The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect to polynomial
Buss +10 more
core +1 more source
The physical Church-Turing thesis and the principles of quantum theory [PDF]
, 2011 Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis.
Arrighi, Pablo, Dowek, Gilles
core +6 more sources
Current Opinion in Neurobiology, 1994 Computation modelling is playing an increasingly accepted and important role in neuroscience. It is not a unitary enterprise, though, and the distinction between two different sorts of modelling, one interested in description and the other also in function, is illustrated by their application to activity-dependent developmental plasticity and adult ...
openaire +3 more sources
The Digital and the Real Universe Foundations of Natural Philosophy and Computational Physics
Philosophies, 2019 In the age of digitization, the world seems to be reducible to a digital computer. However, mathematically, modern quantum field theories do not only depend on discrete, but also continuous concepts.
Klaus Mainzer
doaj +1 more source
Algorithmic Randomness for Infinite Time Register Machines
, 2014 A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and
A. Kechris +3 more
core +1 more source