Results 21 to 30 of about 30,213 (286)
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
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
Computational Symmetry in Computer Vision and Computer Graphics [PDF]
Foundations and Trends® in Computer Graphics and Vision, 2010 In the arts and sciences, as well as in our daily lives, symmetry has made a profound and lasting impact. Likewise, a computational treatment of symmetry and group theory (the ultimate mathematical formalization of symmetry) has the potential to play an important role in computational sciences.
Yanxi Liu 0001 +3 more
openaire +1 more source
The Computational Complexity of Propositional Cirquent Calculus [PDF]
, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
core +1 more source
AI Agents as Universal Task Solvers
EntropyWe describe AI agents as stochastic dynamical systems and frame the problem of learning to reason as in transductive inference: Rather than approximating the distribution of past data as in classical induction, the objective is to capture its algorithmic
Alessandro Achille, Stefano Soatto
doaj +1 more source
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
Asymptotic density, immunity, and randomness
, 2015 In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases.
Astor, Eric P.
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
On Accelerations in Science Driven by Daring Ideas: Good Messages from Fallibilistic Rationalism
Studies in Logic, Grammar and Rhetoric, 2015 The first good message is to the effect that people possess reason as a source of intellectual insights, not available to the senses, as e.g. axioms of arithmetic. The awareness of this fact is called rationalism.
Marciszewski Witold
doaj +1 more source