00:00:08 [wiki] [[7Basic]] http://esolangs.org/w/index.php?diff=44264&oldid=44263 * 161.184.231.102 * (+189) Added compiler section. 00:00:45 Just realized something 00:01:06 Which is what? 00:01:10 Given a board with infinitely repeated sections, snakes & ladders is turing complete 00:01:20 OK, sho wthe proof 00:01:51 ok imagine you have an infinite repeated grid 00:02:10 except the first row and first column have different contents 00:02:37 your x and y position in the grid are basically 2 counters 00:02:54 Isn't snakes&ladders one-dimensional though? 00:03:40 each cell on the grid contains a repeat of the same snakes & ladders squares 00:03:59 so it's one dimensional but it's repeated in a 2d infinite grid 00:04:30 Ah, OK 00:04:38 since the top row and left column have different contents, you can test if your x or y counter are zero by having a different path in those cells 00:05:06 you can increment the x counter by having a path that goes rightways to the next repeated cell 00:05:29 likewise, you can decrement x by going left, increment y by going down, or decrement y by going up 00:06:16 OK 00:06:21 also, you're in a current "state", one of N finite states 00:06:42 that state is represented by the current path you're on in the current cell 00:07:33 that means you have a 2 counter minsky machine -> https://esolangs.org/wiki/Minsky_machine 00:08:00 which is turing complete 00:08:30 the 2 counter minsky machine works by taking the infinite tape, encoding it as 2 stacks 00:08:49 encoding the stack as 2 infinitely large counters 00:10:33 (using the last digit of the counter as top of the stack, doing counter *2 to push a zero, counter *2+1 to push a one, counter /2 to pop, checking for odd/even to read the top of the stack... the second counter is present for manipulation) 00:11:03 which means you can get your infinite tape with only 4 counters 00:12:09 then you can represent your 4 counters using 2 counters by representing your 4 counters as 2^c[0] * 3^c[1] * 5^c[2] * 7^c[3] 00:12:20 and using the second counter for manipulation 00:13:20 I made a version that's based on befunge but with only PC direction change commands but it's the same thing: http://esolangs.org/wiki/nopfunge 00:15:11 it works for any 2d path as long as you can merge 2 paths and you have wire crossings 00:35:38 Sooooooooooooooooooooo 00:40:34 My computer isn't turing complete 00:45:41 ... oooooooooooooooooooooo... 00:51:01 -!- mihow has quit (Quit: mihow). 00:51:41 -!- oerjan has quit (Quit: NiTC). 01:02:26 hioly! 01:02:39 boily! 01:03:08 NEW INFORMAL CS TERM: 01:03:12 CETC 01:03:19 Close Enough to Turing Complete 01:03:45 what's that? 01:04:06 bound storage machines that would be turing complete given some means to access infinite storage? 01:04:15 hppavilion[1], if your language isn't tc then do the job properly and figure out what class it's in 01:04:26 there's a bunch of sub-turing classes for exactly this reason 01:04:28 Phantom_Hoover: NO 01:04:30 *No 01:04:39 I mean to describe computers 01:05:04 Since we can't build a computer with Infinite Memory, we can't build TMs 01:05:16 if you mean the fact that actual computers have memory limits or whatever then i've always thought of that in terms of abstractions 01:05:18 I suppose a "Bounded State Automaton" is the proper term for that 01:06:00 Phantom_Hoover: True, true. A language might not be able to emulate a TRUE TM on a given computer, but it can still be TC 01:06:37 If we allow it to work such that it doesn't have an aribtrary memory limit AS PART OF the language 01:06:40 well it comes down to the spec 01:06:48 Exactly 01:07:14 if you could have a conformant implementation that's TC then the language is TC 01:07:23 (so C is subturing because of the memory limit) 01:07:31 If the spec says "Arrays can only be 1000000 items long", and it isn't under "Implementation notes" or the like, then it isn't TC (assuming we make all the other assumptions) 01:08:12 But I would propose we define "CETC" which describes something that /would/ be TC if it weren't for the fact that we're in the real world 01:10:00 I would prefer a different kind of definition, such as, the number of bits in stuff is implementation-defined but is otherwise TC 01:10:21 That works too 01:12:22 you should also have ABNQEUTC. 01:13:17 -!- boily has quit (Quit: COCONUT CHICKEN). 01:13:25 How is b::=~0 01:13:25 b::=~1 01:13:25 ac::=abc 01:13:25 ::= 01:13:25 abc nondeterministic? 01:13:34 Seems like it would just constantly output "0" 01:14:48 Or, when multiple definitions for a word is given, does the Spec not define how to interpret it? 01:18:52 -!- adu has joined. 01:23:07 Both the rule b::=~0 and b::=~1 are possible to use, so which one is used is not specified. 01:24:37 hppavilion[1], exactly that 01:25:21 -!- madbr has left. 01:25:28 you're guaranteed that a valid substitution will be performed but which one specifically is down to undefined behaviour 01:25:37 Y'know, I think I don't like languages that are purely dynamically typed. 01:25:52 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:25:55 I want my static typechecking. 01:26:14 If I don't know what sort of value a variable will hold, I'll say so. 01:27:51 We need to compoile a list of TC mathematical systems. 01:28:18 What's a "mathematical system"? 01:28:22 tswett: So you want Dynamic AND static typechecking? Basically, you should have a "dyn" type? 01:28:36 tswett: I just needed a quick term for something I don't entirely understand 01:28:42 Examples are: 01:29:32 Re static and dynamic typechecking: more or less. C# has static typechecking, but you can also cast anything to "object", and it performs dynamic typechecking when you try to cast it back. 01:30:17 C# also *does* have a "dynamic" type; if you have a variable of type "dynamic", then you can attempt to call any method or access any property, and the existence of such a method or property will be checked at runtime. 01:30:52 * Unrestricted Grammars (Thue) 01:30:52 * Turing Machines (every normal language) 01:30:53 * Combinatorics (Unlambda) 01:30:53 * Lambda Calculus (Haskell) 01:30:56 Et cetera. 01:31:28 *nod* Mathematical models of computation. 01:31:28 Just a database so that people can find a system (or more) on which to base a new esolang 01:31:37 tswett: THERE we go! 01:32:51 Is: "List of Turing-Complete Models of Computation" a good place to put that list? 01:32:58 tswett? 01:33:37 (This is SOLELY for the TC stuff and generally things you'd WANT to make a language based on) 01:33:55 Sounds good. Put in sentence case, though. 01:34:00 "List of Turing-complete models of computation" 01:36:29 So, in my imaginary programming language, you can define "varieties", which are essentially (finitely generated) categories with all finite limits. 01:37:29 Individual varieties are categories. Varieties also form a category; homomorphisms between varieties are the objects. 01:37:59 You can also define a variety called "Category", which is the variety whose algebras/models are categories. 01:38:41 tswett: Please make up the document so that we can see its working 01:39:30 I'll probably do that at some point. 01:40:08 hppavilion[1]: by the way, I'd say normal languages really don't resemble Turing machines much at all. 01:40:26 tswett: Fair enough 01:40:41 I'd say that Turing machines are a somewhat bad model of computation, in that it's hard for a computer programmer to come up with a Turing machine that executes a given algorithm. 01:40:57 Lambda calculus is much better in that respect. 01:41:17 I think the reason we keep talking about Turing machines is mostly tradition. 01:41:48 Yes, probably it is 01:41:49 What about a reverse turing machine where the tape is the code and the state macine is the data? 01:42:28 I'm not sure if there's entirely a difference other than which one changes at run time. 01:42:33 Now, you *should* be able to express the fact that since varieties are categories, and categories are models of the variety "Category", varieties are models of the variety "Category". 01:42:58 So far, I haven't found a way to tie these three levels of categories together. 01:44:43 I've been working at sort of a dizzyingly high level of abstraction. 01:45:18 Consider an ordinary mathematical value, like, I dunno, the string "abc". 01:46:21 This string is an element of some algebra—namely, the algebra of strings over a certain alphabet. This algebra is a model of some variety—namely, the variety of monoids. This variety is an object in an overarching category—namely, the category of varieties. 01:48:19 Level 1 things are elements of the algebras. Level 2 things are the algebras which model the varieties. Level 3 things are the varieties that classify the algebras. There's only one level 4 thing I'm dealing with, which is the category of varieties, but I can foresee adding a finite number of additional level 4 things. 01:48:21 -!- Dante has joined. 01:48:28 -!- Dante has quit (Client Quit). 01:49:28 So I suppose what I want is a way to treat higher-level things as being lower-level things. 01:50:12 The category of varieties (a level 4 thing) isn't explicitly mentioned in the language, but I should be able to treat it as being a variety (a level 3 thing). 01:50:29 And I should be able to look at any variety (a level 3 thing) as if it were an algebra (a level 2 thing). 01:50:47 And, finally, I should be able to look at any algebra (a level 2 thing) as if it were just an element of an algebra (a level 1 thing). 01:51:26 [wiki] [[List of Turing-complete models of computation]] N http://esolangs.org/w/index.php?oldid=44265 * Hppavilion1 * (+1429) Created page. I'm not very good at this. 01:52:08 hppavilion[1]: good start. 01:52:14 Yuy 01:53:34 I just realized "included for completeness" is a joke xD 01:53:47 By the way, I think you want to say "combinator calculi" instead of "combinatorics". 01:55:12 [wiki] [[List of Turing-complete models of computation]] M http://esolangs.org/w/index.php?diff=44266&oldid=44265 * Hppavilion1 * (+0) Fixed a CN 01:58:23 [wiki] [[List of Turing-complete models of computation]] http://esolangs.org/w/index.php?diff=44267&oldid=44266 * Hppavilion1 * (-20) Fixed some stuff 01:58:59 [wiki] [[List of Turing-complete models of computation]] M http://esolangs.org/w/index.php?diff=44268&oldid=44267 * Hppavilion1 * (+0) Fixed it. One last time. 01:59:12 tswett: Oh. 01:59:59 tswett: Perhaps Combinatory Logic is what I meant? 02:00:37 More or less the same concept, I think. I don't totally understand the distinction between the terms. 02:00:41 [wiki] [[List of Turing-complete models of computation]] http://esolangs.org/w/index.php?diff=44269&oldid=44268 * Hppavilion1 * (+11) s/Combinatorics/Combinatory Logic/ 02:01:20 I like these idea but you should need some document to tell it better. 02:01:33 (If you know what to write so far!) 02:01:55 I'm just linking to the Wikipedia pages for now xD 02:02:05 Does anyone here know of MOAR TCnesses? 02:02:35 Many things are Turing-complete, including Wang tiles 02:03:54 * hppavilion[1] googles wang tiles 02:04:04 OH GOD WHY WOULD YOU SEND ME TO THIS PAGE 02:04:14 Look in Wikipedia isn't it? 02:06:02 I was kidding 02:07:19 tswett: WANG-TILE BASED PROGRAMMING LANGUAGE 02:07:24 Is that feasible? 02:07:31 It's definitely possible. 02:07:43 But is it feasible? 02:08:09 I don't know 02:08:29 Huh 02:08:31 -!- sc00fy has quit (Ping timeout: 252 seconds). 02:08:38 If you were to search my house, would you be able to find a toy zebra? 02:08:38 People have implemented Rule 110 in CSS 02:08:57 tswett: That's exactly why I think it may be infeasible 02:09:00 Sometimes, you don't know whether something is possible or not until you've done it. 02:09:15 tswett: I don't know. That depend on many things including whether or not you have a toy zebra in your house and where it is. 02:09:18 Anyway, I imagine it's probably feasible. 02:09:45 (And if you tell me to get out and call the police for breaking and entering into your house) 02:11:09 I made up this Dungeons&Dragons prestige class: http://zzo38computer.org/dnd/class/wizard_of_knowledge Do you have opinion/complaint of it? 02:34:25 I am not very good at this Minesweeper game I made up; my best time is 878 02:35:34 (The game is 30x16 with 95 bombs) 02:56:18 -!- MDude has changed nick to MDream. 03:12:04 [wiki] [[List of Turing-complete models of computation]] http://esolangs.org/w/index.php?diff=44270&oldid=44269 * Zzo38 * (-48) Using interwiki links 03:19:13 man there are a lot of apl symbols 03:30:26 -!- bb010g has joined. 03:55:49 -!- idris-bot has joined. 04:21:58 ⍀⍁⍂⍃⍄⍅⍆⍇⍈⍉⍊⍋⍌⍍⍎⍏⍐⍑⍒⍓⍔⍕⍖⍗⍘⍙⍚⍛⍜⍝⍞⍟ 04:25:06 > (length "⍀⍁⍂⍃⍄⍅⍆⍇⍈⍉⍊⍋⍌⍍⍎⍏⍐⍑⍒⍓⍔⍕⍖⍗⍘⍙⍚⍛⍜⍝⍞⍟", length ['a'..'z']) 04:25:08 (32,26) 04:37:58 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net). 04:59:08 -!- contrapumpkin has joined. 04:59:31 -!- Wright has quit (Ping timeout: 256 seconds). 05:00:19 -!- copumpkin has quit (Ping timeout: 240 seconds). 05:09:33 [wiki] [[Blackberry]] N http://esolangs.org/w/index.php?oldid=44271 * Virgolang * (+1141) Created page with "It Is a programming language that is stack-based, imperative and long-liner. And I wrote this article from my BB 8520. = Instructions = Instructions is base of Blackberry. == ..." 05:18:59 Is that last bit supposed to be relevent? 05:19:45 [wiki] [[Nopfunge]] http://esolangs.org/w/index.php?diff=44272&oldid=44256 * Keymaker * (+1776) Fixed my MM translator and added it back. 05:24:01 -!- copumpkin has joined. 05:25:26 -!- contrapumpkin has quit (Ping timeout: 240 seconds). 05:37:24 -!- adu has quit (Quit: adu). 05:57:59 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 05:58:45 -!- hppavilion[1] has joined. 06:05:38 zzo38: It looks like wang tiles AREN'T TC 06:05:53 YOu probably read the Wiki Page before that was corrected 06:06:01 OR it was corrected wrongly 06:08:53 hppavilion[1]: How is that? I don't see anything like that? 06:09:13 -!- JesseH has quit (Remote host closed the connection). 06:09:23 zzo38: I read the wiki page. It didn't mention Turing Completeness. 06:09:27 So I read the talk page 06:09:41 Someone said they'd corrected it and that it wasn't TC 06:09:53 How WOULD it be TC, anyway? 06:10:23 Ah, I can see on the talk page, but the article says you can translate any Turing machine into Wang tiles 06:11:31 zzo38: If and only if that TM does not halt 06:11:40 Anyways, someone is asking for a proof that it is not possible to compute functions. Well, I have no proof or disproof of such a statement 06:12:00 s/ not// 06:12:09 zzo38: I think they were kidding 06:12:52 I'm googling ""is turing-complete"" 06:13:00 To find new and exciting TC things 06:13:29 hppavilion[1]: It says they tile the plane if and only if that TM does not halt. 06:13:53 Huh 06:13:55 Weird 06:14:05 Could've sworn it only works if it does 06:15:03 I think that isn't what it says? 06:16:28 I'm not sure "translating any Turing Machine into Wang tiles" counts as being Turing Complete... 06:16:30 "If there is a curb, turn your steering wheel completely away from it if your vehicle faces up the hill," 06:16:30 I'm confused, if the wheel is pointed away from the curb and the car starts moving backwards, won't it move away from the curb? 06:16:30 Or am I confused about steering wheels 06:16:41 I mean, where is the computation in a wang tile? 06:17:58 Unless it means converting it into a /set/ of Wang Tiles for which the /solution/ can be converted /back/ into the TM's solution 06:18:00 Well 06:18:03 "Solution" 06:18:20 I also am not quite sure by now, but it seem to me that it would be somehow, but I am not quite sure 06:18:24 I suppose TMs don't have a solution, especially not ones that don't halt 06:20:29 A Turing machine halts if and only if there exists a proof that it halts. (But you cannot necessarily prove that it does not halt.) 06:21:18 zzo38: I think that "if and only if" means you can 06:21:31 Oh wait 06:21:37 No it doesn't 06:21:46 Because that proof is hard to find xD 06:30:19 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 07:04:30 -!- ^v has quit (Ping timeout: 272 seconds). 07:41:10 zzo38: yes, that is correct 07:42:19 -!- Frooxius has joined. 07:50:26 -!- AnotherTest has joined. 07:54:41 -!- bender| has joined. 08:12:34 -!- J_Arcane has quit (Ping timeout: 244 seconds). 08:34:20 -!- Frooxius has quit (Quit: *bubbles away*). 08:40:57 -!- Patashu has joined. 09:00:29 -!- heddwch has quit (Read error: Connection reset by peer). 09:01:21 -!- heddwch has joined. 09:05:32 -!- impomatic_ has joined. 09:34:09 -!- sc00fy has joined. 10:12:53 -!- sc00fy has quit (Ping timeout: 252 seconds). 10:15:49 -!- Phantom_Hoover has joined. 10:17:36 -!- J_Arcane has joined. 10:18:52 -!- boily has joined. 10:54:29 -!- boily has set topic: ɛ̃ˈglɪʃ spɛˈliŋ ʀɘfɔʀm/ | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/ | https://esolangs.org/. 11:25:08 -!- boily has quit (Quit: POSSESSED CHICKEN). 11:54:26 -!- x10A94 has joined. 11:58:59 -!- J_Arcane has quit (Ping timeout: 265 seconds). 12:03:46 ɛˈglɪʃ? 12:08:32 that's only spoken in igloos 12:09:39 -!- oerjan has joined. 12:17:38 -!- J_Arcane has joined. 12:26:40 @ask hppavilion[1] um, you _do_ know about https://esolangs.org/wiki/Category:Computational_models, right? i'm not saying there shouldn't be a main page but you don't need to link to wikipedia for most of these. 12:26:40 Consider it noted. 12:30:29 why are petri nets not on this list? 12:31:34 because no one wrote a page, i guess. 12:34:09 zzo38: i see you changed the wikipedia links to be interwiki. this is a perfect example of why i dislike those: these are links to wikipedia pages that could mostly have been to our own pages instead, but there's no visual difference in my browser so if i don't click them or look at the source i won't see that there is something to correct. 12:37:34 oerjan: what? don't interwiki links have a different color than intrawiki ones? 12:38:18 Are people still playing BF Joust? 12:38:53 impomatic_: sure 12:39:13 impomatic_: the next expansion set is coming out in a few days 12:39:51 b_jonas: if there's a difference it is ridiculously subtle. 12:40:17 Modified rules? 12:40:26 far smaller than the difference between visited and unvisited links 12:41:34 b_jonas: these are _not_ ordinary external links, but special namespaces for wikipedia etc. that mediawiki allows by default 12:42:56 impomatic_: b_jonas is joking, however zemhill is now working again, so there was recently a little activity. 12:43:26 EgoBot also works, though. 12:44:21 Yes, I'm joking about M:tG, sorry. 12:46:26 -!- Patashu has quit (Ping timeout: 246 seconds). 12:46:56 [wiki] [[List of Turing-complete models of computation]] http://esolangs.org/w/index.php?diff=44273&oldid=44270 * Oerjan * (-2) Fix case and make links point to our own wiki, see also 12:48:03 [wiki] [[List of Turing-complete models of computation]] http://esolangs.org/w/index.php?diff=44274&oldid=44273 * Oerjan * (+4) missed one 12:57:32 too stupid, eh... 12:59:07 int-e: what 13:00:41 oerjan: just quoting randomly from that esolang wiki article 13:07:22 `2014 13:07:23 No output. 13:07:48 `cat bin/2014 13:07:50 ​#!/bin/sh \ if [ $(date +%Y) = "$(basename "$0")" ] \ then echo "Hello, world!" \ fi 13:10:16 -!- impomatic_ has quit (Quit: http://corewar.co.uk). 13:20:52 -!- `^_^v has joined. 13:29:13 -!- TieSoul has joined. 13:46:59 -!- trn has quit (Ping timeout: 260 seconds). 13:48:25 -!- trn has joined. 13:48:28 -!- Wright has joined. 14:02:05 -!- tswett has quit (Changing host). 14:02:05 -!- tswett has joined. 14:02:41 [wiki] [[User:B jonas]] http://esolangs.org/w/index.php?diff=44275&oldid=40175 * B jonas * (+120) 14:05:02 -!- Wright has quit (Ping timeout: 272 seconds). 14:14:28 -!- bender| has changed nick to bender\. 14:14:33 -!- bender\ has changed nick to bender|. 14:15:36 -!- bender| has changed nick to bender. 14:21:58 -!- FreeFull has changed nick to FreeFull_. 14:22:06 -!- FreeFull_ has changed nick to Mooji. 14:22:14 -!- Mooji has changed nick to FreeFull. 14:52:35 -!- Crazy4Tech has joined. 15:19:10 -!- nortti has changed nick to rhyfel. 15:19:36 -!- rhyfel has changed nick to lirael. 15:19:42 -!- lirael has changed nick to snorttiu. 15:19:43 -!- snorttiu has changed nick to snortti. 15:20:20 -!- snortti has changed nick to wombatman. 15:21:03 -!- wombatman has changed nick to unbender. 15:21:13 -!- unbender has changed nick to nortti. 15:23:07 -!- Crazy4Tech has quit (Quit: Leaving). 15:28:19 -!- sebbu2 has joined. 15:28:19 -!- sebbu2 has quit (Changing host). 15:28:19 -!- sebbu2 has joined. 15:28:38 -!- sebbu has quit (Ping timeout: 244 seconds). 15:28:40 -!- sebbu2 has changed nick to sebbu. 15:31:30 -!- bender has quit (Quit: [g2g]). 15:36:46 -!- Vorpal has joined. 15:36:46 -!- Vorpal has quit (Changing host). 15:36:46 -!- Vorpal has joined. 15:58:02 @tell hppavilion[1] Who says you have to be able to be able to *use* a model of computation? You can just convert a program into Wang tiles and call it a day. 15:58:02 Consider it noted. 16:11:51 I want my quantum computer already 16:13:16 -!- bb010g has quit (Quit: Connection closed for inactivity). 16:14:53 -!- MDream has changed nick to MDude. 16:19:47 but that requires a time-traveling quantum computer 16:22:10 this might be slightly relevant and i might eventually get through enough of my tabs to read it myself http://www.scottaaronson.com/blog/?p=2464 16:22:47 now back to elliotts and extraterrestrials. 16:22:57 * & 16:42:15 -!- ais523 has joined. 16:45:19 -!- hppavilion[1] has joined. 16:47:52 What combinators are there? 16:48:00 SKI, BCKW, Y, what else? 16:49:36 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds). 16:50:36 several called "X", I remember reading about a few more 16:51:52 isn't there a whole combinator bird book 16:51:54 You don't even need I, SK is enough 16:52:28 https://en.wikipedia.org/wiki/To_Mock_a_Mockingbird 16:52:45 -!- ^v has joined. 16:53:11 this has a list http://www.angelfire.com/tx4/cus/combinator/birds.html 16:53:19 I think I should read that book 16:53:52 Could you use CSS to change interwiki links to a different colours? 16:54:37 -!- Phantom_Hoover has joined. 16:55:24 zzo38: i'm pretty sure we asked elliott about that some time, and there was a problem... 16:55:27 oerjan: But the other reason I changed them is because one of them wasn't working anyways 16:56:00 zzo38: well now i changed most of them to point at our own wiki 16:56:13 Yes, that is better anyways 16:59:07 oerjan: Oh right, To Mock a Mockingbird 16:59:13 That's on my Amazon Wishlist :) 16:59:35 Interwiki links have the "extiw" CSS class, so you should be able to change the colours using that in your user CSS 16:59:55 ooh 17:00:42 I want to make a non-tarbit based on Combinator Calculus 17:00:50 Probably called Bluebird 17:01:07 (You can format self links too) 17:01:31 Or Alps, named after the SKI combinator calculus 17:01:39 s/tarbit/tarpit/ 17:02:05 -!- Thisbe has joined. 17:02:24 zzo38: as usual, i'd prefer it to work for everyone 17:02:25 .extiw { color: blue; } 17:02:34 B(BBB)(B(BBB)) 17:02:40 Bald Eagle Combinator 17:02:53 You can set it in the global CSS then, and then users who do not want that can disable it in their user CSS. 17:03:55 Wait 17:04:02 Is the guy in charge ON IRC with us? 17:04:54 in charge of what? 17:05:53 Of the Wiki 17:06:06 fizzie: are you with us? 17:06:14 hppavilion[1]: i'm pretty sure i could set it too 17:06:18 as could ais523 17:06:29 Huh 17:06:30 Interesting 17:06:31 fizzie is currently in charge of the wiki (in terms of having the highest level of permissions) 17:06:38 Aaaah 17:06:41 Didn't know that 17:06:44 but several people here have pretty high permissions, such as me and oerjan 17:06:53 OK 17:07:00 I wasn't sure who was who in this world xD 17:07:08 i've changed CSS before 17:07:30 We should fix the page on Combinatory Logic 17:07:42 It only talks about the SKI cominbators, which is wrong 17:08:14 hppavilion[1]: you can fix that yourself if you like, although probably in a separate section 17:08:17 -!- ^v has quit (Read error: Connection reset by peer). 17:08:20 Or at least talk about other than just important combinators 17:08:33 lambda calculus maps pretty well onto S, K, I, Y 17:08:49 untyped lambda calculus doesn't need the Y, because you can implement it in terms of the others 17:09:04 and I can be implemented as (SK)K, although that's mostly just coincidence 17:09:15 [wiki] [[Combinatory logic]] M http://esolangs.org/w/index.php?diff=44276&oldid=38949 * Hppavilion1 * (+17) Added a heading for when I update this later to talk about other important combinators 17:09:19 I is like ~ from Underload, it isn't technically needed but it fits really neatly into the language 17:10:01 oerjan: ais523: We have interwiki links? What color are they now? 17:10:11 Stack Based Combinatory Logic Language 17:10:19 they are currently afaict identical to internal links 17:10:28 It'd use the S, B, C, and L combinators (see what I did there?) 17:10:30 fizzie: we have one to Wikipedia, and I thought they were light blue 17:10:58 or well, they might be _slightly_ lighter blue 17:11:08 You can be implemented as SKK? 17:11:10 same colour as external links, but without hte arrow 17:11:27 You can make them even more difference if you want to then 17:11:28 what i'd liked is to add the arrow. 17:11:41 or perhaps their own symbol 17:11:52 [wiki] [[Esolang:Sandbox]] http://esolangs.org/w/index.php?diff=44277&oldid=43900 * Ais523 * (+59) testing various links 17:11:58 -!- JesseH has joined. 17:12:03 here, spot the difference: http://esolangs.org/wiki/Esolang:Sandbox 17:12:19 Like night and day. 17:12:45 I'm sure you could also add a symbol with CSS. 17:13:14 Unfortunately, I've visited the pages on intercal xD 17:13:26 i vaguely recall there was some problem doing that 17:14:02 At least in Mozilla it is possible to turn off visited links formatting globally 17:14:02 The external link icon seems to be added by a "background-image: url(data:...);" style. 17:14:12 -!- ais523 has quit. 17:14:16 (Which I have done) 17:14:37 fizzie: more over there are heaps them for different formats 17:14:39 -!- ais523 has joined. 17:14:40 *- 17:14:52 fizzie: more over there are heaps them for different formats 17:14:55 *- 17:14:57 Mm. 17:15:17 I found a way to make Combinatory Logic languages a /little/ easier to read 17:15:34 anyway, later -> 17:15:39 Make the lexer detect combinators with this regex: /[A-Z][a-z]*/ 17:15:55 And ignore whitespace, of course 17:16:11 And colons at the end of combinators 17:16:11 -!- ais523 has quit (Client Quit). 17:16:25 -!- ais523 has joined. 17:18:07 -!- ais523 has quit (Client Quit). 17:18:25 -!- oerjan has quit (Quit: leaving). 17:18:31 That'd make it easier to read 17:18:46 -!- ais523 has joined. 17:19:18 Constant: x (Conatant: x) 17:19:31 That produces the Identity combinator 17:20:07 -!- ais523 has quit (Client Quit). 17:20:30 How do you add with combinators? 17:20:40 -!- ais523 has joined. 17:22:07 -!- ais523 has quit (Client Quit). 17:22:21 -!- ais523 has joined. 17:26:11 -!- ais523 has quit (Client Quit). 17:26:41 -!- ais523 has joined. 17:27:39 -!- hppavilion[1] has quit (Ping timeout: 265 seconds). 17:28:11 -!- ais523 has quit (Client Quit). 17:36:18 -!- ais523 has joined. 17:42:11 -!- ais523 has quit. 17:42:24 -!- ais523 has joined. 17:44:07 -!- ais523 has quit (Client Quit). 17:45:35 -!- ais523 has joined. 17:50:24 -!- hppavilion[1] has joined. 17:53:20 -!- Thisbe has quit (Quit: Thisbe). 17:53:47 Again 17:53:51 How do you add with combinators? 17:53:54 -!- ais523 has quit. 17:55:00 As in, numbers? 17:55:00 Well, you have to figure out how you're representing numbers first. 17:55:05 Church numerals are good. 17:55:12 -!- ais523 has joined. 17:55:22 hppavilion[1]: you add with combinators the same way you add with any other Church numeral 17:55:46 * ais523 looks up the definition of addition in The Underlambda Project 17:55:47 * hppavilion[1] forgets what Church Numerals are 17:55:58 Let's see. Zero is KI, one is I, two is... eh, who cares about two. 17:56:02 -!- nycs has joined. 17:56:07 -!- ais523 has quit (Client Quit). 17:56:10 * hppavilion[1] thinks they're how you represent numbers in Lambda Caclucus 17:56:23 All right, let's do lambda calculus numbers instead. 17:56:23 -!- ais523 has joined. 17:56:32 the formal definition is apparently a(:)~*(~a*^)*~*(~*)* 17:56:33 Zero: \f. \x. x 17:56:38 One: \f. \x. f x 17:56:49 Five: \f. \x. f (f (f (f (f x)))) 17:56:53 You get the picture. 17:57:06 but there's a note that it can be optimized 17:57:20 if you kow for a fact that you're dealing with integers 17:57:40 tswett: you can convert \f.\x.f(f(x)) to combinators using the usual algorithm 17:57:45 I jus forget what the usual algorithm is 17:58:10 it's probably on the unlambda website (that is, the algorithm definitely is, the result of applying it to 2 might be) 17:58:44 Let's see. Start with the first bit, you get \f. S (K f) f. 17:58:54 Then do it again, and it's, uh. 17:59:12 -!- `^_^v has quit (Ping timeout: 255 seconds). 17:59:18 S (S (K S) S) I, I think? 17:59:33 Um, make that... 17:59:39 S (S (K S) K) I. 18:00:01 the Unlambda website says 2 is ``s``s`kski 18:00:15 so it agrees with you 18:00:24 and 3 is ``s``s`ksk``s``s`kski 18:00:34 Let's see. S (S (K S) K) I f x = S (K S) K f (I f) x = K S f (K f) f x = S (K f) f x = K f x (f x) = f (f x) 18:01:17 This is "so easy". 18:01:18 Parenthesis are important in Combinatory Logic, correct? 18:01:22 Yup. 18:01:26 Or are they just decorative? 18:01:27 OK 18:01:34 Or some other way of specifying precedence. 18:01:40 That makes making a Combinatory Logic language a /bit/ more difficult 18:01:47 To decrement (and hence to substract) Church integers is by no means impossible. I don't know if it can be done with even moderate efficiency, however. 18:02:06 The Underlambda Project subtracts integers via forming a lookup table of all possible subtractions, and then indexing it 18:05:31 Combinatory Haskell, anyone? 18:06:37 OK 18:06:39 So 18:10:07 -!- ais523 has quit. 18:10:19 -!- ais523 has joined. 18:14:11 -!- ais523 has quit (Client Quit). 18:17:21 -!- ais523 has joined. 18:18:07 -!- ais523 has quit (Client Quit). 18:19:33 -!- ais523 has joined. 18:27:06 -!- hppavilion[1] has quit (Ping timeout: 265 seconds). 18:34:07 -!- ais523 has quit. 18:43:59 -!- ais523 has joined. 18:45:09 -!- FreeFull has quit (Remote host closed the connection). 18:47:42 How do I tell Mozilla to request HTTPS resources from a proxy rather than tunneling the connection through the proxy? 18:53:50 -!- sc00fy has joined. 19:05:54 ais523: sure, if you want efficiency, you'd use some sort of radixal numerical representation, like base 2 or a higher base for efficiency 19:06:17 I have haskell code for binary integers at http://www.math.bme.hu/~ambrus/pu/Bin.hs 19:06:46 obviously then you have to know how to translate algebraic structures to lambda calculus or directly to unlambda 19:07:09 -!- FreeFull has joined. 19:07:36 -!- sc00fy has quit (Ping timeout: 264 seconds). 19:10:07 -!- ais523 has quit. 19:11:27 -!- ais523 has joined. 19:17:16 -!- MDude has quit (Ping timeout: 272 seconds). 19:19:18 -!- NewHorizons has joined. 19:26:07 -!- ais523 has quit. 19:26:43 -!- ais523 has joined. 19:30:11 -!- ais523 has quit (Client Quit). 19:30:41 -!- NewHorizons has left ("See #NewHorizons for info"). 19:36:16 -!- ais523 has joined. 19:47:32 [wiki] [[Stare/1.0]] M http://esolangs.org/w/index.php?diff=44278&oldid=44206 * Hppavilion1 * (+2) Changed the procedure with arguments syntax (I DID say it was frozen, but I realized this makes lexers stateless and thus easier) 19:50:11 -!- ais523 has quit. 19:51:56 -!- zzo38 has left. 19:52:02 -!- zzo38 has joined. 19:54:11 -!- mihow has joined. 20:07:12 -!- nycs has quit (Quit: This computer has gone to sleep). 20:16:29 How much do you know of the very old rules of Magic: the Gathering? I don't know much about it. 20:17:07 How old? 20:18:10 From before Alpha up to Fifth Edition 20:19:35 I guess they had things like interrupts until Fifth Edition. 20:20:07 -!- atrapado has joined. 20:20:18 Yes, they had complicated timing rules I do not completely understand, although I saw a diagram, the diagram doesn't explain everything. There was also damage prevention steps. 20:21:43 I think they may not have understood the rules completely either. 20:22:04 You could only target spells (to counter it or whatever) *before* it was placed onto the stack, I think; once it reached the stack it was too late. 20:22:06 -!- x10A94 has quit (Read error: Connection reset by peer). 20:22:07 whoa whoa whoa, they had so many great cards back then 20:22:15 Like Illusionary Mask 20:22:48 There were a lot of interrupt steps inside of other interrupt steps, and I think even the damage prevention step is a normal step inside of an interrupt step, but with the restriction that only damage prevention effects can be played. 20:23:31 And you don't lose due to running out of life points until the end of a phase. 20:23:42 -!- Hoolootwo has quit (Read error: Connection reset by peer). 20:23:55 -!- Hoolootwo has joined. 20:26:10 Artifacts were disabled when tapped, I think also mana abilities were interrupts (although on lands this was implied, on other cards it must be specified) 20:28:18 pre-sixth edition rules? no, luckily I don't know them. 20:29:19 I have also seen some cards from before Alpha, and can see how those work too (but I am not certain about any of this): The large mana symbol on lands existed before Alpha, activation costs implicitly included tapping (there was no "Mono Artifact"), activation costs were printed next to the casting cost, mana costs like "5GG" meant "five manas, at least two of which are green", Plains cards had pictures of airplanes on it 20:34:11 The old Magic: the Puzzling are using old rules, so it would help to know all of the old rules of various editions 20:35:01 -!- ais523 has joined. 20:38:46 I have a idea though, a kind of Magic: the Puzzling where it has one solution that works only without manaburn and another solution that works only if manaburn is reinstated 20:38:56 -!- puckipedia has quit (Remote host closed the connection). 20:41:06 -!- puckipedia has joined. 20:41:34 I want to see if any of you who can see my "Wizard of Knowledge" prestige class of Dungeons&Dragons game to see any suggestion to fixed or whatever 20:49:46 -!- S1 has joined. 21:05:51 -!- TieSoul has quit (Remote host closed the connection). 21:25:01 }<}}}<}}<}}}<}}<}}<}}<}}}}<}}}<}}<}} 21:25:29 S1: Which is what? 21:25:46 http://esolangs.org/wiki/BitChanger 21:26:13 KO 21:26:14 OK 21:26:16 Ignoring the memory mapping of Gregor Richards and simply mapping every next eight bits to one ascii char, my program should be a valid greeting 21:28:03 (cause I'm not sure if that Gregor Richards mapping belongs to the specification or just is an extra idea) 21:28:17 (so I'm ignoring it for now) 21:29:50 "Specification" is pretty arbitrary with esolangs. 21:30:06 I forced that style of I/O on the world by being the only person who implemented the language. 21:30:07 you know what I mean 21:30:18 I see 21:30:25 so I'll have to get used to that, oh well 21:30:37 Or make your own impl *shrugs* 21:30:43 yea yea some day 21:30:45 Or modify egobch to do whatever you'd like 21:45:51 do the laundry? 21:46:58 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 21:58:41 -!- boily has joined. 22:10:10 -!- ais523 has quit. 22:11:33 -!- APic has quit (Ping timeout: 252 seconds). 22:14:36 -!- Wright has joined. 22:16:07 -!- APic has joined. 22:18:04 -!- staffehn has quit (Remote host closed the connection). 22:20:34 -!- staffehn has joined. 22:21:59 -!- APic has quit (Ping timeout: 240 seconds). 22:22:42 -!- S1 has quit (Quit: We are the revolutionaries). 22:56:18 How do you tell Mozilla to request HTTPS stuff from a proxy rather than making the connection through the proxy? 22:59:07 -!- hppavilion[2] has joined. 22:59:53 -!- oerjan has joined. 23:01:30 http://forums.mozillazine.org/viewtopic.php?f=38&t=358889 This is what I want it to do 23:06:37 Hell♨! 23:07:13 -!- atrapado has quit (Quit: Leaving). 23:08:15 hellore! 23:08:38 (let's check the logs. not sure it went through correctly.) 23:08:58 eh, nah. 23:09:28 `unicode  23:09:29 U+F6A7 - No such unicode character name in database \ UTF-8: ef 9a a7 UTF-16BE: f6a7 Decimal:  \  () \ Uppercase: U+F6A7 \ Category: Co (Other, Private Use) \ Bidi: L (Left-to-Right) 23:10:18 it was supposed to be U+1F6A7 CONSTRUCTION SIGN. somewhere the astral plane character was basicified. 23:10:20 bohily 23:10:26 hellørjan! 23:16:34 -!- Patashu has joined. 23:16:37 -!- hppavilion[2] has quit (Ping timeout: 265 seconds). 23:21:05 -!- llue has joined. 23:21:08 @ask ais523 whoa, what's rnz() all about? 23:21:09 Consider it noted. 23:22:44 `? rnz 23:22:45 rnz? ¯\(°​_o)/¯ 23:22:53 -!- lleu has quit (Ping timeout: 250 seconds). 23:27:19 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=44279&oldid=44261 * 74.122.187.254 * (+13) Ajsone 23:28:38 shachaf: maybe it's a typoed nrz? 23:29:57 [wiki] [[Ajsone]] N http://esolangs.org/w/index.php?oldid=44280 * 74.122.187.254 * (+686) Ajsone 23:33:31 No Raptor Zone? Natural Rhinoceros Zoo? fungot? 23:33:31 boily: i find there is no 23:33:41 ah, so the no raptor zone it is. 23:43:18 It's a random variable with the best distribution. 23:43:49 https://nethackwiki.com/wiki/File:Rnz100.svg 23:44:26 Many natural processes are well approximated by the rnz distribution. (Disclaimer: lie.) 23:45:18 it's used in a nasty perverse roguelike. it's a direct manifestation from the RNG. it's an EVIL distribution! 23:50:22 -!- ^v has joined. 23:58:23 I guess I should ask coppro. 23:58:33 coppro: What's with rnz()? 23:59:38 -!- hppavilion[2] has joined.