Results 31 to 40 of about 3,053,426 (341)
Program Analysis Is Harder Than Verification: A Computability Perspective
International Conference on Computer Aided Verification, 2018 We study from a computability perspective static program analysis, namely detecting sound program assertions, and verification, namely sound checking of program assertions.
P. Cousot +2 more
semanticscholar +1 more source
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
Informational Worldview. Scientific Foundations, and Philosophical Perspectives
Studies in Logic, Grammar and Rhetoric, 2016 In the text, I synthetically discuss the cultural background, computer science basis, and philosophical potential of an informational worldview, which I treat as an indirect link between awareness of the significance of contemporary achievements of ...
Stacewicz Paweł
doaj +1 more source
Computability Beyond Church-Turing via Choice Sequences
Logic in Computer Science, 2018 Church-Turing computability was extended by Brouwer who considered non-lawlike computability in the form of free choice sequences. Those are essentially unbounded sequences whose elements are chosen freely, i.e. not subject to any law.
M. Bickford +3 more
semanticscholar +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
Philosophia Mathematica, 2005 The authors desire to characterize the natural numbers by their structure, as opposed to designating a particular choice of objects like \(\emptyset\), \(\{\emptyset\}\), etc. But at the same time, they wish to rule out nonstandard models -- and not to make their description circular.
Halbach, V, Horsten, LFM
openaire +4 more sources
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2015 In this note, we explore various potential representations of the set of countable ordinals. An equivalence class of representations is then suggested as a standard, as it offers the desired closure properties.
A. Pauly
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
Approximation systems for functions in topological and in metric spaces [PDF]
Logical Methods in Computer Science, 2013 A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names.
Dimiter Skordev
doaj +1 more source
Symmetric tensors: rank, Strassen's conjecture and e-computability [PDF]
, 2015 In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new cases.
E. Carlini +4 more
semanticscholar +1 more source