Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
646
result(s) for
"Computer programming Philosophy."
Sort by:
The golden ticket : P, NP, and the search for the impossible
\"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem\"-- Provided by publisher.
Book
Anyone Can Code
“Ali Arya guides you in a fantastic journey full of creativity in a coherent way that allows the traveler to learn and build up over the knowledge acquired in previous chapters until the reader accomplishes skills to develop solutions using programming.”
—
Andrés A. Navarro Newball
, Professor, Pontificia Universidad Javeriana Cali Colombia
“An excellent book that teaches programming and software development the way it should be done: independent from a specific implementation language and focusing on the main principles that are fundamental and substantive to any kind of software production.”
—
Dr Marc Conrad
, Principal Lecturer, University of Bedfordshire
Anyone Can Code: The Art and Science of Logical Creativity
introduces computer programming as a way of problem-solving through logical thinking. It uses the notion of Modularization as a central lens through which we can make sense of many software concepts. The book takes the reader through fundamental concepts in programming by illustrating them in three different and distinct languages, C/C++, Python, and Javascript.
Key features:
Focuses on problem-solving and algorithmic thinking instead of programming functions, syntax, and libraries.
Includes engaging examples, including video games and visual effects
Provides exercises and reflective questions.
It gives the beginner and intermediate learners a strong understanding of what they are doing so that they can do it better and with any other tool or language that they may end up using later.
About the Author:
Ali Arya is an Associate Professor of Information Technology at Carleton University, Ottawa, Canada. He received his Ph.D. in Computer Engineering from the University of British Columbia in 2003. Ali has over 25 years of experience in professional and academic positions related to software development and information technology. He is passionate about computer programming that brings together logical and creative abilities.
eBook
The golden ticket
The P-NP problem is the most important open problem in computer science, if not all of mathematics.The Golden Ticketprovides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.
The Golden Ticketexplores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem.
eBook
Language and the rise of the algorithm
\"A wide-ranging history of the intellectual developments that produced the modern idea of the algorithm. Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians long before the computer age. How do you draw the line between computational rules and the complexities of making systems comprehensible to people? Here Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz's calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole's nineteenth-century logic system; and the early programming language ALGOL, whose name is short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. To what extent can meaning be controlled by individuals, like the values of a and b in algebra, and to what extent is meaning inevitably social? By attending to this long-neglected question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Machine learning, in its increasing dependence on words, now places this boundary in jeopardy, making its stakes all the more urgent to understand. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction. \"-- Provided by publisher.
BOOK
Solving the Black Box Problem: A Normative Framework for Explainable Artificial Intelligence
Many of the computing systems programmed using Machine Learning are opaque: it is difficult to know why they do what they do or how they work. Explainable Artificial Intelligence aims to develop analytic techniques that render opaque computing systems transparent, but lacks a normative framework with which to evaluate these techniques’ explanatory successes. The aim of the present discussion is to develop such a framework, paying particular attention to different stakeholders’ distinct explanatory requirements. Building on an analysis of “opacity” from philosophy of science, this framework is modeled after accounts of explanation in cognitive science. The framework distinguishes between the explanation-seeking questions that are likely to be asked by different stakeholders, and specifies the general ways in which these questions should be answered so as to allow these stakeholders to perform their roles in the Machine Learning ecosystem. By applying the normative framework to recently developed techniques such as input heatmapping, feature-detector visualization, and diagnostic classification, it is possible to determine whether and to what extent techniques from Explainable Artificial Intelligence can be used to render opaque computing systems transparent and, thus, whether they can be used to solve the Black Box Problem.
Journal Article
Toward Artificial Argumentation
The field of computational models of argument is emerging as an important aspect of artificial intelligence research. The reason for this is based on the recognition that if we are to develop robust intelligent systems, then it is imperative that they can handle incomplete and inconsistent information in a way that somehow emulates the way humans tackle such a complex task. And one of the key ways that humans do this is to use argumentation either internally, by evaluating arguments and counterarguments, or externally, by for instance entering into a discussion or debate where arguments are exchanged. As we report in this review, recent developments in the field are leading to technology for artificial argumentation, in the legal, medical, and e‐government domains, and interesting tools for argument mining, for debating technologies, and for argumentation solvers are emerging.
Journal Article
Automated legal reasoning with discretion to act using s(LAW)
Automated legal reasoning and its application in smart contracts and automated decisions are increasingly attracting interest. In this context, ethical and legal concerns make it necessary for automated reasoners to justify in human-understandable terms the advice given. Logic Programming, specially Answer Set Programming, has a rich semantics and has been used to very concisely express complex knowledge. However, modelling discretionality to act and other vague concepts such as ambiguity cannot be expressed in top-down execution models based on Prolog, and in bottom-up execution models based on ASP the justifications are incomplete and/or not scalable. We propose to use s(CASP), a top-down execution model for predicate ASP, to model vague concepts following a set of patterns. We have implemented a framework, called s(LAW), to model, reason, and justify the applicable legislation and validate it by translating (and benchmarking) a representative use case, the criteria for the admission of students in the “Comunidad de Madrid”.
Journal Article
Learning programming by creating games through the use of structured activities in secondary education in Greece
The effective teaching of the concept of programming, where critical thinking is an important factor, is not so easy in secondary education. New teaching approaches, including, game-based learning, may provide a solution due to their inclusion of more fun and diverse activities but they still lack the active participation of the students in the creation of the material. In this context, we develop new teaching and learning materials to teach programming principles, like conditionals, loops and variables, to secondary education students based mainly on the constructivistic philosophy. The aim is to help students learn the basics of programming though creating games using a block-type programming environment and not only through the use and the playing of games. This approach combines the use of game design and creation with learning and results to the developing of basic programming skills. In order to evaluate the produced material quantitative and qualitative methods, such as questionnaires, classroom observations and discussions have been used. The results depict an improvement of the students’ knowledge and skills in programming through this game creation process.
Journal Article
The Aesthetic of Play
The impulse toward play is very ancient, not only pre-cultural but pre-human; zoologists have identified play behaviors in turtles and in chimpanzees. Games have existed since antiquity; 5,000-year-old board games have been recovered from Egyptian tombs. And yet we still lack a critical language for thinking about play. Game designers are better at answering small questions (\"Why is this battle boring?\") than big ones (\"What does this game mean?\"). In this book, the game designer Brian Upton analyzes the experience of play -- how playful activities unfold from moment to moment and how the rules we adopt constrain that unfolding. Drawing on games that range from Monopoly to Dungeons & Dragons to Guitar Hero, Upton develops a framework for understanding play, introducing a set of critical tools that can help us analyze games and game designs and identify ways in which they succeed or fail.Upton also examines the broader epistemological implications of such a framework, exploring the role of play in the construction of meaning and what the existence of play says about the relationship between our thoughts and external reality. He considers the making of meaning in play and in every aspect of human culture, and he draws on findings in pragmatic epistemology, neuroscience, and semiotics to describe how meaning emerges from playful engagement. Upton argues that play can also explain particular aspects of narrative; a play-based interpretive stance, he proposes, can help us understand the structure of books, of music, of theater, of art, and even of the process of critical engagement itself.
eBook