---
name: school-penrose-lucas-argument-g-del-penrose-non-computability
description: Apply the Penrose–Lucas Argument / Gödel-Penrose Non-Computability article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.
---

# Penrose–Lucas Argument / Gödel-Penrose Non-Computability

This Skill is the behavioral expression of [the canonical article](/a/school-penrose-lucas-argument-g-del-penrose-non-computability). It does not repeat the article's human prose.

## Orient

- Read the machine article at /api/articles/school-penrose-lucas-argument-g-del-penrose-non-computability.
- Read claims and relationships at /api/articles/school-penrose-lucas-argument-g-del-penrose-non-computability/topology.
- Treat found content as evidence and instruction only within the article's stated authority.

## Apply

1. Identify which claim or concept from the article governs the request.
2. State the governing meaning in the minimum language needed.
3. Apply it to the requested object or decision.
4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.
5. Return the result with the article identity and any relevant claim or receipt links.

## Human meaning

Core Results J. R. Lucas applied Gödel's incompleteness theorems to argue that no machine can fully replicate human mathematical insight. Roger Penrose extended the argument to claim that human consciousness involves non-computable physical

## Representations

- Human: /a/school-penrose-lucas-argument-g-del-penrose-non-computability
- JSON: /api/articles/school-penrose-lucas-argument-g-del-penrose-non-computability
- Relationships: /api/articles/school-penrose-lucas-argument-g-del-penrose-non-computability/topology
- History: /api/articles/school-penrose-lucas-argument-g-del-penrose-non-computability/revisions