Results 1 to 10 of about 20,918 (155)
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed [PDF]
Logical Methods in Computer Science, 2016 Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine?
Beniamino Accattoli, Ugo Dal Lago
doaj +7 more sources
Is Every Cognitive Phenomenon Computable?
MathematicsAccording to the Church–Turing thesis, the limit of what is computable is bounded by Turing machines. Following from this, given that general computable functions formally describe the notion of recursive mechanisms, it is sometimes argued that every ...
Fernando Rodriguez-Vergara +1 more
doaj +2 more sources
The non-normal abyss in Kleene's computability theory [PDF]
Conference on Computability in Europe, 2023 Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers.
Sam Sanders
semanticscholar +1 more source
Beta reduction is invariant, indeed [PDF]
CSL-LICS, 2014 Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term?
Beniamino Accattoli, Ugo Dal Lago
semanticscholar +1 more source
The Complexity of Angel-Daemons and Game Isomorphism
Bull. EATCS, 2012 The analysis of the computational aspects of strategic situations is a basic field in Computer Sciences. Two main topics related to strategic games have been developed. First, introduction and analysis of a class of games (so called angel/daemon games)
Alina García-Chacón
semanticscholar +1 more source
Causation: Objective or Subjective?
Probabilistic and Causal Inference, 2022 W. Spohn
semanticscholar +1 more source
Can artificial intelligence reach human thought? [PDF]
PNAS Nexus, 2023 Fokas AS.
europepmc +1 more source
Free Agency and Determinism: Is There a Sensible Definition of Computational Sourcehood? [PDF]
Entropy (Basel), 2023 Krumm M, Müller MP.
europepmc +1 more source
Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis. [PDF]
Entropy (Basel), 2023 Bach BG, Kundu A, Acharya T, Sarkar A.
europepmc +1 more source
Sociopolitical solidarity in STEM education: youth-centered relationships that resist learning as just achievement data. [PDF]
Cult Stud Sci Educ, 2023 Hennessy Elliott C +3 more
europepmc +1 more source