Agentic Horizons

This episode explores a formal theory of situations, causality, and actions designed to help computer programs reason about these concepts. The theory defines a "situation" as a partial description of a state of affairs and introduces fluents—predicates or functions representing conditions like "raining" or "at(I, home)." Fluents can be interpreted using predicate calculus or modal logic.

The theory uses the "can" operator to express the ability to achieve goals or perform actions in specific situations, with axioms related to causality and action capabilities. Two examples illustrate the theory in action: the Monkey and Bananas problem, showing how a monkey can obtain bananas by using a box, and a Simple Endgame, analyzing a winning strategy in a two-person game.

The episode concludes by comparing the proposed logic with Prior's logic of time distinctions, discussing possible extensions and acknowledging differences in their approach to inevitability.

https://apps.dtic.mil/sti/tr/pdf/AD0785031.pdf

This episode explores John McCarthy's 1959 paper, "Programs with Common Sense," which introduces the concept of an "advice taker" program capable of solving problems using logical reasoning and common sense knowledge.Key aspects include the need for programs that reason like humans, McCarthy's proposal for an advice taker that deduces solutions through formal language manipulation, and the importance of declarative sentences for flexibility and logic. The advice taker would use heuristics to select relevant premises and guide the deduction process, similar to how humans use both conscious and unconscious thought.

The episode also touches on the philosophical implications, challenges, and historical significance of McCarthy's vision, offering insights into the early ambitions of AI research and the quest for machines with true common sense.

http://logicprogramming.stanford.edu/readings/mccarthy.pdf

This episode explores an AI-powered simulation system designed to study large-scale societal manipulation. The system, built on the Concordia framework and integrated with a Mastodon server, allows researchers to simulate real-world social media interactions, offering insights into how manipulation tactics spread online.The researchers demonstrated the system by simulating a mayoral election in a fictional town, involving different agent types, such as voters, candidates, and malicious agents spreading disinformation. The system tracked voting preferences and social dynamics, revealing the impact of manipulation on election outcomes.

The episode discusses key findings, including the influence of social interactions on biases, and calls for further research to enhance the realism and scalability of the simulation. Ethical concerns are addressed, with an emphasis on using the simulator to develop defenses against AI-driven manipulation, safeguarding democratic processes.

https://arxiv.org/pdf/2410.13915

This episode explores a novel approach to reducing AI hallucinations in large language models (LLMs), based on the research titled Good Parenting is all you need: Multi-agentic LLM Hallucination Mitigation. The research addresses the issue of LLMs generating fabricated information (hallucinations), which undermines trust in AI systems. The solution proposed involves using multiple AI agents, where one generates content and another reviews it to detect and correct hallucinations. Testing various models, such as Llama3, GPT-4, and smaller models like Gemma and Mistral, the study found that advanced models like Llama3-70b and GPT-4 achieved near-perfect accuracy in correcting hallucinations, while smaller models struggled.The research emphasizes the effectiveness of multi-agent workflows in improving content accuracy, likening it to "good parenting." Additionally, models using Groq architecture demonstrated faster interaction times, making them ideal for real-time applications. This approach shows great promise in enhancing AI reliability and trustworthiness.

https://arxiv.org/pdf/2410.14262

This episode explores Alan Turing's 1936 paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," which laid the foundation for computer science and AI.

Key topics include:

- Turing's concept of the Turing machine, a theoretical device that can perform any calculation a human could.

- The definition of computable numbers, numbers that can be generated by a Turing machine.

- The existence of universal computing machines, capable of simulating any other Turing machine, leading to general-purpose computers.

- Turing's proof that some numbers cannot be computed by any machine using the diagonalization method.

- His demonstration of the unsolvability of the Entscheidungsproblem, showing no general algorithm exists for proving all logical statements.

The episode also covers Turing's later work on effective calculability, proving its equivalence with computability. This foundational work is crucial for understanding the limits of computation and the development of AI.

https://www.cs.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf

This episode explores Yann LeCun's vision for creating autonomous intelligent agents that learn and interact with the world like humans, as outlined in his paper, "A Path Towards Autonomous Machine Intelligence." LeCun emphasizes the importance of world models, which allow agents to predict the consequences of their actions, making AI more efficient and capable of generalization.

The proposed cognitive architecture includes key modules like Perception, World Model, Cost Module, Short-Term Memory, Actor, and Configurator. The system operates in two modes: Mode-1 (reactive behavior) and Mode-2 (reasoning and planning). Initially, the agent uses Mode-2 to carefully plan, then transitions to faster Mode-1 execution through training.LeCun highlights self-supervised learning (SSL) as essential for training world models, particularly using Joint Embedding Predictive Architecture (JEPA), which focuses on predicting abstract world representations. Hierarchical JEPAs allow for multi-level planning and handle uncertainty through latent variables.

The episode concludes by discussing the potential implications of this approach for achieving human-level AI, beyond scaling existing models or relying solely on rewards.

https://openreview.net/pdf?id=BZ5a1r-kVsf

The 1956 Dartmouth Summer Research Project on Artificial Intelligence marked a foundational moment for AI research. The study explored the idea that any aspect of human intelligence could be precisely described and simulated by machines. Researchers focused on key areas such as programming automatic computers, enabling machines to use language, forming abstractions and concepts, solving problems, and the potential for machines to improve themselves. They also discussed the roles of neuron networks, the need for efficient problem-solving methods, and the importance of randomness and creativity in AI.Individual contributions included Claude Shannon’s work on applying information theory to computing and brain models, Marvin Minsky’s focus on machines that learn and navigate complex environments, Nathaniel Rochester’s exploration of machine originality through randomness, and John McCarthy’s development of artificial languages for reasoning and problem-solving. The Dartmouth project laid the groundwork for future AI research by combining these diverse approaches to understand and replicate human-like intelligence in machines.

http://jmc.stanford.edu/articles/dartmouth/dartmouth.pdf

This episode explores the findings of the 2015 One Hundred Year Study on Artificial Intelligence, focusing on "AI and Life in 2030." It covers eight key domains impacted by AI: transportation, home/service robots, healthcare, education, low-resource communities, public safety and security, employment, and entertainment.The episode highlights AI's potential benefits and challenges, such as the need for trust in healthcare and public safety, the risk of job displacement in the workplace, and privacy concerns. It emphasizes that AI systems are specialized and require extensive research, with autonomous transportation likely to shape public perception. While AI can improve education, healthcare, and low-resource communities, meaningful integration with human expertise and attention to biases is crucial.Key takeaways include the importance of public policy to guide AI development and the need for research and discourse on AI's societal impact to ensure its benefits are distributed fairly.

https://arxiv.org/pdf/2211.06318

This episode explores Alan Turing's 1950 paper, "Computing Machinery and Intelligence," where he poses the question, "Can machines think?" Turing reframes the question through the Imitation Game, where an interrogator must distinguish between a human and a machine through written responses.

The episode covers Turing's arguments and counterarguments regarding machine intelligence, including:

- Theological Objection: Thinking is exclusive to humans.

- Mathematical Objection: Gödel’s theorem limits machines, but similar limitations exist for humans.

- Argument from Consciousness: Only firsthand experience can prove thinking, but Turing argues meaningful conversation is evidence enough.

- Lady Lovelace's Objection: Machines can only do what they are programmed to do, but Turing believes they could learn and originate new things.

Turing introduces the idea of learning machines, which could be taught and programmed like a developing child’s mind, with rewards, punishments, and logical systems. The episode concludes with Turing’s optimistic view that machines will eventually compete with humans in intellectual fields, despite challenges in programming.

https://courses.cs.umbc.edu/471/papers/turing.pdf

This episode explores Marvin Minsky's 1960 paper, "Steps Toward Artificial Intelligence," focusing on five key areas of problem-solving: Search, Pattern Recognition, Learning, Planning, and Induction.

- Search involves exploring possible solutions efficiently.

- Pattern recognition helps classify problems for suitable solutions.

- Learning allows machines to apply past experiences to new situations.

- Planning breaks down complex problems into manageable parts.

- Induction enables machines to make generalizations beyond known experiences.

Minsky also discusses techniques like hill-climbing for optimization, prototype-derived patterns and property lists for pattern recognition, reinforcement learning and secondary reinforcement for shaping behavior, and planning using models for complex problem-solving. His paper highlights the need to combine multiple techniques and develop better heuristics for intelligent systems.

https://courses.csail.mit.edu/6.803/pdf/steps.pdf