<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Research on Nacho's Blog</title><link>https://nachooglpz.pages.dev/tags/research/</link><description>Recent content on Nacho's Blog</description><generator>Hugo</generator><language>en-AU</language><lastBuildDate>Wed, 07 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://nachooglpz.pages.dev/tags/research/index.xml" rel="self" type="application/rss+xml"/><item><title>Computer science as empirical inquiry: symbols and search</title><link>https://nachooglpz.pages.dev/archives/011-computer-science-as-empirical-inquiry-symbols-and-search/</link><pubDate>Wed, 07 Oct 2026 00:00:00 +0000</pubDate><guid>https://nachooglpz.pages.dev/archives/011-computer-science-as-empirical-inquiry-symbols-and-search/</guid><description>Newell and Simon present their view on computer science: the machine as the organism we study.</description></item><item><title>Heuristics Are the Secret Sauce</title><link>https://nachooglpz.pages.dev/blog/006-heuristics-are-the-secret-sauce/</link><pubDate>Wed, 07 Oct 2026 00:00:00 +0000</pubDate><guid>https://nachooglpz.pages.dev/blog/006-heuristics-are-the-secret-sauce/</guid><description>In computer science, each machine and software is an experiment.</description></item><item><title>Relational Completeness of Data Base Sublanguages</title><link>https://nachooglpz.pages.dev/archives/009-relational-completness-of-data-base-sublanguages/</link><pubDate>Thu, 01 Oct 2026 00:00:00 +0000</pubDate><guid>https://nachooglpz.pages.dev/archives/009-relational-completness-of-data-base-sublanguages/</guid><description>Ted Codd&amp;rsquo;s paper which established the equivalence in expressive power between relational calculus and relational algebra.</description></item></channel></rss>