We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database co...
We derive an abstract computational model from a sequential computational model that is generally used for function execution. This abstract computational model allows for the concurrent execution of functions. We discuss concurrent models for functi...
Computational Politics is the study of computational methods to analyze and moderate users' behaviors related to political activities such as election campaign persuasion, political affiliation, and opinion mining. With the rapid development and ease...
This paper examines conceptual models and their application to computational thinking. Computational thinking is a fundamental skill for everybody, not just for computer scientists. It has been promoted as skills that are as fundamental for all as nu...
In this paper we present a brief discussion on the salient points of the computational analysis that are at the basis of the paper \cite{StSc}. The computational and data analysis have been made with the software Mathematica$^\circledR$ and presented...
Notebooks and documents to build Computational Mechanics course (⭐ 64)
The meaning of COMPUTATIONAL is having to do with computation. How to use computational in a sentence.
Would I be considered a competent candidate for an M.Sc. in Computational Biology if I have a bachelors degree in Pharmacy (cGPA 3.93) with some research experience but no formal computational backgro...
Course 18.S191 at MIT, Fall 2022 - Introduction to computational thinking with Julia (⭐ 2789)
Computational is an adjective referring to a system of calculating or "computing," or, more commonly today, work involving computers. Tasks with a lot of computational steps are best performed on …
COMPUTATIONAL definition: relating to work involving computers or calculations. See examples of computational used in a sentence.
In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than computing...
We develop a theoretical framework for defining and identifying flows of information in computational systems. Here, a computational system is assumed to be a directed graph, with "clocked" nodes that send transmissions to each other along the edges...
Books Wolfram Community Wolfram Blog Public Resources Wolfram|Alpha Wolfram Problem Generator Wolfram Challenges Computer-Based Math Computational Thinking Computational Adventures …
Computational Intelligence: a Logical Approach is a new textbook on artificial intelligence (AI). It covers logic, reasoning, representation, learning, probability, robotics, search, abduction, Prolog.
In this article we present Enhanced Rhetorical Structure Theory (eRST), a new theoretical framework for computational discourse analysis, based on an expansion of Rhetorical Structure Theory (RST). The framework encompasses discourse relation graphs...
Classically, the time complexity of a first-order method is estimated by its number of gradient computations. In this paper, we study a more refined complexity by taking into account the `lingering' of gradients: once a gradient is computed at $x_k$,...
We build on the work of Berg, Boyar, Favrholdt, and Larsen, who developed a complexity theory for online problems with and without predictions (IJTCS-FAW, volume 15828 of LNCS, Springer, 2025) where they define a hierarchy of complexity classes that...
This chapter reviews measures of emergence, self-organization, complexity, homeostasis, and autopoiesis based on information theory. These measures are derived from proposed axioms and tested in two case studies: random Boolean networks and an Arctic...
It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P / poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of complexity theo...