←2018-12-16 2018-12-17 2018-12-18→ ↑2018 ↑all
00:00:02 -!- danieljabailey has quit (Quit: ZNC 1.6.6+deb1ubuntu0.1 - http://znc.in).
00:00:22 -!- danieljabailey has joined.
00:00:24 <b_jonas> ] 4^5
00:00:31 <b_jonas> j-bot: 4^5
00:00:32 <j-bot> b_jonas: 1024
00:00:37 <b_jonas> whatever is its short invocation
00:00:40 <b_jonas> ) 4^5
00:03:02 <b_jonas> [ 4^5
00:03:03 <j-bot> b_jonas: 1024
00:03:04 <b_jonas> ( 4^5
00:04:02 <imode> what's the graph analogue of the lambda calculus, I wonder. I know what it means to apply a term tree to another term tree (like function application), but I don't know of something like that for arbitrary graphs.
00:09:33 <imode> reason I'm wondering is because I'm looking for a model of computation that closely resembles some "natural" form of knowledge, and graphs are able to represent knowledge pretty easily via the semantic network concept.
00:17:15 <imode> though I'm open to other forms of knowledge representation... graphs get weird.
00:22:01 -!- Essadon has quit (Quit: Qutting).
00:52:12 -!- tromp has quit (Remote host closed the connection).
00:52:50 -!- tromp has joined.
01:03:21 <imode> maybe graph grammars will point me in the right direction..
01:07:53 <imode> there's an internal struggle in me. on the one hand, I want a graph-based model of computation that features no variables that I can use to encode knowledge and model stuff. on the other hand, I acknowledge that anything that looks like it will probably look like some variant of combinatory logic.
01:09:17 <b_jonas> imode: you do know about Eodermdrone. although that does contain variables, namely captures
01:11:24 <imode> yeah... I thought "well, what if we could take graphs and "apply them" to other graphs to derive new graphs according to some rules." but that'd just lead to combinators, with your "base graph" and the method of combining two graphs being two combinators, and any given graph is just a different set of applications.
01:13:41 <imode> like it'd be nice to take, for example, some subgraphs encoding facts, and another subgraph encoding some set of derivation rules, mash 'em together and get a set of derived facts.
01:13:55 <imode> but the actual structure of those applications is combinatoric.
01:30:20 <imode> perhaps I have to accept that everything reduces to some combinator set.
01:52:54 <imode> curry was a genius.
02:04:48 -!- nfd9001 has joined.
02:06:57 -!- nfd has quit (Ping timeout: 250 seconds).
02:07:41 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
02:50:51 -!- b_jonas has quit (Quit: leaving).
02:52:16 -!- nchambers has joined.
03:01:55 -!- S_Gautam has quit (Quit: Connection closed for inactivity).
03:22:48 <imode> Problem: Does a class of graph grammars exist such that each grammar does not admit free or bound variables on either the Left-Hand Side or Right-Hand Side and is also Turing Complete?
03:28:48 -!- Lord_of_Life has quit (Ping timeout: 250 seconds).
03:29:24 -!- Lord_of_Life has joined.
04:26:45 <esowiki> [[Your Pong May Minsky]] https://esolangs.org/w/index.php?diff=58742&oldid=55875 * Chris Pressey * (-23) No one has complained, which means the proof must be okay, that's how it works right?
04:40:47 -!- nodist has joined.
04:45:25 <esowiki> [[Talk:The Waterfall Model]] https://esolangs.org/w/index.php?diff=58743&oldid=55865 * Chris Pressey * (+814) Sketch of computable real making sub-TC language into TC
04:47:01 -!- nodist has quit (Quit: Leaving).
05:09:44 <int-e> @metar lowi
05:09:45 <lambdabot> LOWI 170450Z VRB01KT 9999 FEW007 BKN200 M04/M05 Q1018 R08/19//95 NOSIG
05:10:00 -!- doesthiswork1 has quit (Quit: Leaving.).
05:34:50 -!- hexfive has joined.
05:34:53 -!- nchambers has changed nick to Rudolph.
05:56:37 -!- ATMunn has quit (Ping timeout: 250 seconds).
05:57:26 -!- moony has quit (Ping timeout: 250 seconds).
05:57:39 -!- Bowserinator has quit (Ping timeout: 252 seconds).
05:59:21 -!- moony has joined.
06:02:34 -!- Bowserinator has joined.
06:02:42 -!- ATMunn has joined.
06:18:27 -!- nfd9001 has quit (Ping timeout: 240 seconds).
06:23:19 -!- FreeFull has quit.
07:13:58 -!- S_Gautam has joined.
08:01:51 -!- imode has quit (Ping timeout: 250 seconds).
08:22:39 -!- sebbu2 has joined.
08:25:02 -!- tromp has quit (Remote host closed the connection).
08:25:17 -!- tromp has joined.
08:25:53 -!- sebbu has quit (Ping timeout: 246 seconds).
08:40:16 -!- AnotherTest has joined.
08:46:06 -!- AnotherTest has quit (Ping timeout: 244 seconds).
09:02:36 -!- arseniiv has joined.
09:19:34 -!- salpynx has joined.
09:23:37 -!- S_Gautam has quit (Quit: Connection closed for inactivity).
09:24:01 <salpynx> imode: re. graph grammers, I was wondering if L-systems are applicable to your search? I was recently trying to find out the relationship between Lsystems and cellular automata, and there are numerous papers not readily readable on the subject, I couldn't find a straight answer. I think they can be used to implement automata rules
09:24:24 -!- S_Gautam has joined.
09:25:16 <salpynx> searching just now how L-systems relate to graphs I found this interesting book chapter of L-systems, graphs, and Super Mario Bros level design: http://pcgbook.com/wp-content/uploads/chapter05.pdf
09:50:44 -!- AnotherTest has joined.
09:54:48 -!- tromp has quit (Remote host closed the connection).
09:55:24 -!- tromp has joined.
10:13:28 -!- tromp has quit (Remote host closed the connection).
10:13:44 -!- tromp has joined.
10:59:05 -!- salpynx has quit (Quit: Page closed).
11:43:37 -!- S_Gautam has quit (Quit: Connection closed for inactivity).
11:57:58 -!- AnotherTest has quit (Ping timeout: 245 seconds).
12:01:03 <esowiki> [[Hieroglyphic]] https://esolangs.org/w/index.php?diff=58744&oldid=46401 * Salpynx * (+849) format command list
12:11:39 <esowiki> [[Hieroglyphic]] https://esolangs.org/w/index.php?diff=58745&oldid=58744 * Salpynx * (+152) attempt to clarify commands based on example usage
12:26:50 <esowiki> [[Your Pong May Minsky]] M https://esolangs.org/w/index.php?diff=58746&oldid=58742 * Chris Pressey * (+18)
12:28:51 <esowiki> [[Hieroglyphic]] M https://esolangs.org/w/index.php?diff=58747&oldid=58745 * Salpynx * (+0) /* Syntax */ correct diacritic
13:36:42 -!- AnotherTest has joined.
14:00:28 -!- doesthiswork has joined.
14:21:02 -!- S_Gautam has joined.
14:50:21 -!- sleepnap has joined.
15:09:33 -!- AnotherTest has quit (Ping timeout: 250 seconds).
15:12:03 -!- MDude has quit (Ping timeout: 244 seconds).
15:29:52 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
15:30:19 -!- Lord_of_Life has joined.
15:36:24 -!- MDude has joined.
15:52:46 -!- arseniiv has quit (Quit: gone completely :o).
15:56:19 -!- arseniiv has joined.
15:58:02 -!- Essadon has joined.
16:05:26 -!- AnotherTest has joined.
16:20:01 -!- tromp has quit (Remote host closed the connection).
16:20:37 -!- tromp has joined.
16:22:11 -!- tromp has quit (Remote host closed the connection).
16:22:25 -!- tromp has joined.
16:40:26 -!- arseniiv has quit (Quit: gone completely :o).
16:40:34 -!- arseniiv has joined.
16:40:51 -!- arseniiv has quit (Read error: Connection reset by peer).
16:48:24 -!- arseniiv has joined.
16:50:53 <esowiki> [[Talk:Your Pong May Minsky]] https://esolangs.org/w/index.php?diff=58748&oldid=55880 * Chris Pressey * (+519) /* Continuous waterfalls */
17:04:22 <esowiki> [[Talk:Your Pong May Minsky]] M https://esolangs.org/w/index.php?diff=58749&oldid=58748 * Chris Pressey * (+1) /* Continuous waterfalls */
17:34:20 -!- arseniiv has quit (Quit: gone completely :o).
18:00:45 -!- arseniiv has joined.
18:08:11 -!- sebbu2 has quit (Read error: Connection reset by peer).
18:13:16 -!- sebbu has joined.
18:24:13 -!- tromp has quit (Ping timeout: 245 seconds).
18:43:16 -!- arseniiv has quit (Quit: gone completely :o).
18:43:25 -!- arseniiv has joined.
18:44:58 -!- tromp has joined.
18:47:58 -!- Phantom_Hoover has joined.
18:53:37 -!- S_Gautam has quit (Quit: Connection closed for inactivity).
19:03:01 -!- imode has joined.
19:07:54 -!- arseniiv has quit (Quit: gone completely :o).
19:08:56 -!- arseniiv has joined.
19:14:23 -!- imode has quit (Quit: WeeChat 2.3).
19:14:31 -!- b_jonas has joined.
19:19:22 <b_jonas> `olist 1149
19:19:24 <HackEso> olist 1149: shachaf oerjan Sgeo FireFly boily nortti b_jonas
19:21:39 -!- sleepnap has quit (Ping timeout: 268 seconds).
19:35:18 -!- sleepnap has joined.
20:07:32 -!- arseniiv has quit (Quit: gone completely :o).
20:07:41 -!- arseniiv has joined.
20:57:31 <oren> makefile:84: *** unterminated variable reference. Stop.
20:57:44 <oren> Augh
20:58:47 <oren> I hate how makefile syntax and bash syntax interact in unhelpful ways
20:59:33 <oren> does make really need to use $ for its variable sigil?
21:00:08 <oren> if make used say : or something then there would be no issue
21:46:09 -!- Lymia has quit (Ping timeout: 252 seconds).
21:57:04 -!- Lymia has joined.
22:00:07 -!- Rudolph has quit (Ping timeout: 240 seconds).
22:22:22 -!- FreeFull has joined.
22:27:17 -!- S_Gautam has joined.
22:36:27 -!- AnotherTest has quit (Ping timeout: 252 seconds).
22:42:34 -!- sleepnap has left.
23:10:42 <b_jonas> `? 25770
23:10:44 <HackEso> 25770? ¯\(°​_o)/¯
23:13:43 <b_jonas> `? 25772
23:13:44 <HackEso> 25772? ¯\(°​_o)/¯
23:13:44 <b_jonas> `? 25771
23:13:45 <HackEso> 25771? ¯\(°​_o)/¯
23:13:53 <b_jonas> `? 25773
23:13:54 <HackEso> 25773? ¯\(°​_o)/¯
23:14:11 <oren> ZSTTE
23:19:19 -!- imode has joined.
23:42:51 <oren> #!/usr/bin/perl -CS
23:42:51 <oren> use utf8;
23:42:52 <oren> print chr(0x2571+int(rand(2))) while 1;
23:51:57 <imode> is that the maze drawer.
23:57:07 <esowiki> [[Talk:The Waterfall Model]] https://esolangs.org/w/index.php?diff=58750&oldid=58743 * Ais523 * (+945) /* Waterclocks over the reals */ r to Chris Pressey: a concrete example of a language with this property
23:58:04 -!- arseniiv has quit (Ping timeout: 246 seconds).
23:58:20 <esowiki> [[Talk:The Waterfall Model]] https://esolangs.org/w/index.php?diff=58751&oldid=58750 * Ais523 * (+110) clarify where my reply is going, rather than dumping a bunch of statements with no context
←2018-12-16 2018-12-17 2018-12-18→ ↑2018 ↑all