User contributions for Patcail
Jump to navigation
Jump to search
20 April 2025
- 07:0707:07, 20 April 2025 diff hist +47 User:Patcail No edit summary current
- 07:0507:05, 20 April 2025 diff hist +3,952 N HOL Created page with "'''HOL''' known as '''Higher Order Lambda''', is a language that combines [https://en.wikipedia.org/wiki/Higher-order_logic higher order logic] with [https://en.wikipedia.org/wiki/Simply_typed_lambda_calculus typed lambda calculus]. The goal is to be extremely powerful model of mathematics and computation while being extremely well-defined. == Objects and Syntax == There are two types of objects: '''terms''' and '''types'''. Let's start with the types first: in BNF th..." current
- 06:1706:17, 20 April 2025 diff hist +102 SE calculus No edit summary current
- 03:0303:03, 20 April 2025 diff hist +29 User:Patcail No edit summary
- 03:0303:03, 20 April 2025 diff hist +2,808 N SE calculus Created page with "'''SE Calculus''' is a modification of regular SKI combinator calculus to make it much more powerful; as powerful as set theory itself. It removes the K and I combinators and added the new '''E''' combinator. On the surface, we wish to define: Ewxyz = y if x == y, and Ewxyz = z otherwise However, the true definition is much more sophisticated as the naive definition is paradoxical: what does it mean for combinator equality? And moreover, th..."
16 April 2025
- 22:2022:20, 16 April 2025 diff hist +45 Meta Minsky Machine No edit summary current
- 18:4818:48, 16 April 2025 diff hist +25 User:Patcail No edit summary
- 18:4818:48, 16 April 2025 diff hist +2,171 N Meta Minsky Machine Created page with "'''Meta Minsky Machine''' (MMM) is a hyperarithmetic language which allows for it to ask about its own halting. Specifically, it allows for paradoxical programs if their simulation structure is not well-founded. == Specification == There are three registers: A, B, and C. The machine also has a state, so really we can think of this like a HLSM. The command format is as followed: (number indicating current state) (action) (register and new states) Specifically, here a..."
- 17:5517:55, 16 April 2025 diff hist −1 m Beeping cyclic tag No edit summary current
- 17:5517:55, 16 April 2025 diff hist +541 Beeping cyclic tag No edit summary
- 06:5006:50, 16 April 2025 diff hist +24 User:Patcail No edit summary
- 06:4906:49, 16 April 2025 diff hist +1,797 N Beeping cyclic tag Created page with "'''Beeping Cyclic Tag''' aims to be super-Turing complete tarpit inspired by Bitwise Cyclic Tag (i.e. this program is as powerful as a Turing machine augmented with an oracle). This is a very rudimentary Turing Tarpit that is stronger than a regular Turing machine. == Commands == There are two data queues: Q1 and Q2, and an internal variable Q. We start with Q=Q1 but we may toggle it to Q=Q2 and Q=Q1. All commands here are two bits: 11: If the..."
15 April 2025
- 06:2906:29, 15 April 2025 diff hist +1 m User:Patcail No edit summary
- 06:2906:29, 15 April 2025 diff hist +13 User:Patcail No edit summary
- 06:2706:27, 15 April 2025 diff hist +3,518 N Rayofuck Created page with "'''Rayofuck''' is an extension of brainfuck that adds a new set-theoretic [https://en.wikipedia.org/wiki/Rayo%27s_number Rayo's function]. This function is extremely fast growing that it outgrows all [https://en.wikipedia.org/wiki/Busy_beaver Busy beaver numbers], oracle busy beaver numbers, hyperarithmetic busy beavers, and so on. == Definition == + Increment the cell pointer value (unbounded) - Attempt to decrement the cell pointer value (lower bounded by 0) <..."
- 05:5205:52, 15 April 2025 diff hist +68 N User:Patcail Created page with "Models of computation I am looking at (hypercomputation): Σ∞"
14 April 2025
- 05:2505:25, 14 April 2025 diff hist +4,453 N Σ∞ Created
- 02:4702:47, 14 April 2025 diff hist +137 Esolang:Introduce yourself Testing this