Computing

Software rarely fails because it lacks a feature; it fails because it cannot scale, cannot recover, or cannot be securely maintained. Yet, Non-Functional Requirements (NFRs) are routinely treated as an afterthought, reduced to vague, untestable wishes like "the system must be reliable." This upfront ambiguity is the leading cause of crippling technical debt, endless refactoring, and late-stage architectural collapse. Enter the NFR Refiner (submitted as part of Kaggle's AI Agents: Intensive Vibe Coding hackathon project): an intelligent assistant that transforms static engineering methodologies into a live, interactive experience. The NFR Refiner agent doesn't just passively record requirements. It actively interviews stakeholders, enforces strict quality standards, fetch real-world industry benchmarks, and translates fuzzy human intent into strictly verifiable Planguage based specifications. Brief Historical Context Software process engineering has long struggled wi...

The Turing test was created to distinguish intelligent machines from human thinkers, and the question it raises is nearly as old as computer science itself. Over time, countless variations of the test have focused on one familiar idea: spotting errors, awkwardness, or other signs of imperfection that might reveal a machine behind the answer. That approach is becoming less useful as modern systems grow better at sounding polished and convincing. In this blog, I explore a simple extension to the classic test: instead of asking whether an answer is flawless, I ask whether it is stereotypical. My argument is that this shift reveals a more subtle weakness—one that many of today’s leading AI systems still struggle to hide. The New Test Harness The core idea behind this new test harness is straightforward: instead of judging an answer in isolation, the evaluator would run it through multiple AI systems and measure how strongly it reflects the same familiar patterns; see the image below. The ...

In mathematics and computer science, asymptotic expansions provide a fundamental framework for managing complexity and reasoning about underlying processes at an appropriate level of granularity. For example, the discrete quantity represented by the n-th harmonic number , H n , can be approximated as ln n + O(1). This approximation offers the intuitive insight that harmonic numbers grow logarithmically, while also indicating that the omitted terms remain bounded by a constant. When greater precision is required, additional terms may be introduced—for instance, Euler’s constant —yielding a refined expression of the form H n = ln n + γ + O(1/n). A similar analogy applies to AI-friendly publications, such as my study helper for An Introduction to the Analysis of Algorithms, Second Edition , by RS and PF. This type of document is built around expandable AI prompts, which function in a manner analogous to asymptotic expansions for quantities of interest. The initial prompt (a solution of...

Vibe coding is the latest technological breakthrough related to AI assisted software development. It truly changes how we think about the software engineering discipline. The crucial question is can we tame, control and regulate the underlying AI engines to do exactly what we want without a fear of dangerous side-effects? This blog tries to shed some light on available approaches, that ironically have always been part of industry best-practices: requirements engineering and API-centricity . To make the exposition concrete, I've developed an educational unit Vibe Coding Demo , purely generated via Google Antigravity ; the repository contains all the technical details of the project, together with useful external reading materials. The key point is that the core input was the product requirements document, all the rest just happened . Why API-Centricity? By starting with an API-centric paradigm, we are able to harness AI productivity while maintaining strict architectural and securit...

In education teachers strive to demystify tough concepts by coming up with succinct and minimalistic examples and case studies. Frequently, despite investing great effort, the underlying mechanisms remain surrounded by mystic clouds just because the substrate over which things are exposed is at an overly high abstraction level. This is the case with recursion when illustrated via mainstream programming languages. In this blog, I would like to share a different approach of explaining processes under the hood using a low conceptual programming layer, namely machine language. It is remarkable how students easily comprehend recursion at this level without being dragged into thinking what is really going on in the background in programs written in Java, C#, Python, or any other modern programming language. Problem Description For teachers the booksite accompanying the book Computer Science: An Interdisciplinary Approach by Robert Sedgewick and Kevin Wayne is an excellent source of educati...

We strive to craft maintainable software systems, since evolution of large systems is their most important and longest lifecycle phase. Various software development paradigms, like functional and object-oriented programming, contain wealth of approaches how to attain the previous objective. One of them is the creation and usage of custom data types. This blog peeks into the power of strongly typed programming languages and shows via a simple case study how to devise a flexible application by adorning it with custom data types. For this purpose I will use Java, but the general ideas are language agnostic. Problem Description For teachers the booksite  accompanying the book Computer Science: An Interdisciplinary Approach by Robert Sedgewick and Kevin Wayne is an excellent source of educational materials. I will provide here solutions to some exercises that are not published in this book nor on the booksite, at the time of writing this document. The main task is to write a client ...