00:00:00 --- log: started forth/13.04.15 00:17:00 --- join: protist (~protist@140.173.69.111.dynamic.snap.net.nz) joined #forth 00:27:24 --- join: epicmonkey (~epicmonke@188.134.41.112) joined #forth 00:37:49 this looks like an interesting series of blog posts: http://www.falvotech.com/blog2/blog.fs/articles/1049 00:37:54 i've only read the first one. 00:38:12 talking about his approach to development in forth, with an example of building a text editor 00:38:20 using test-driven development and stepwise refinement. 00:49:12 --- quit: lazyden (Quit: lazyden) 00:49:20 --- quit: epicmonkey (Ping timeout: 245 seconds) 00:55:48 the miniforth is interesting 00:59:00 haven't gotten that far 00:59:36 its kumul mentioned days ago 00:59:46 http://angg.twu.net/miniforth-article.html 01:00:05 oh :) 01:00:19 oh yeah.. i skimmed this a long time ago but never really read it 01:01:32 i am really reading it, and found its really simple for impl on a dynamic runtime 01:02:19 this article is clearer to me than starting forth 01:06:34 well the series of articles i linked turned out to only have two posts (though they're both good)... so i will read the lua one now :) 01:11:29 "Note that we don't have a separate variable for the instruction pointer (IP); we use the top of the return stack (RS) as IP." that's clever but it means they'd lose >R... it would need an auxiliary general purpose stack... 01:12:02 well he just build an forth like lang 01:13:40 and i need refer stutsk again 01:14:10 the author send me a precompiled version, so i wrote an recurese version of fibonacci 01:14:25 but the benchmark is horrible 01:14:49 but i still like its concept 01:15:46 hrm 01:15:50 I like this mode idea. 01:16:32 I'm not sure I understand what the author meant, but it makes me think of the strategy pattern. 01:17:11 Or.. Hrm. Not really strategy either I guess. 01:17:16 --- quit: protist (Quit: Konversation terminated!) 01:21:37 tangentstorm: what do you mean by mode idea? 01:21:58 in the miniforth article, the author talks about "modes" 01:22:46 i thought its founded by forth, err 01:23:39 He's generalizing what forth does. 01:23:59 instead of a single boolean for the compile state, he has a whole array of modes. 01:24:55 the way i read it is that he's swapping out the "step" functions for the inner and outer interpreters. 01:26:10 yes , but seems forth only need two modes 01:26:55 btw, how many impl ways of forth there are? i mean things like DTC,ITC or what ever 01:28:57 beats me. lots, i'm sure. :) 01:30:23 can you show me some difference terms other than DTC and ITC? 01:51:59 I've seen the term "function threaded" before 01:52:36 http://www.figuk.plus.com/build/heart.htm 01:53:32 here's another way to implement forth. i don't know what you would call it... hardware ? http://www.greenarraychips.com/home/documents/index.html#GA144 01:54:11 the chip implements forth 01:54:22 is it still threaded code? i don't know. 01:56:44 :) 01:56:58 * c00kiemon5ter must implement his forth 01:59:32 yunfan : you could implement forth by composing a graph and having a little walker crawl around on the graph. 01:59:58 so what's the difference between subroutine and call TC? 02:00:21 each function could be a ring of nodes with a "clasp" node. to call the function, you create a node on one ring that points to the clasp node on another ring. 02:00:27 tangentstorm: i want to impl one, but the forth standards give too many words 02:00:53 * tangentstorm implemented a forth with 0 words. :D 02:01:25 https://github.com/sabren/b4/blob/master/go/empty.pas 02:01:26 i want to know can i impls about 40 words and claim its my forth? 02:01:51 sure, why not? :) 02:02:03 btw, i have my own vm and a handcode AS tool 02:02:28 tangentstorm: but they would say its not forth because it dont follow the standards 02:02:41 oh 02:02:59 02:03:02 chuck doesn't even like the idea of having a standard 02:03:05 call it something else then 02:04:10 i think there should be a standards which wont let you confuse when you read other's code 02:04:11 that rlwrap thing is cool, c00kiemon5ter ... thanks :) 02:04:40 well maybe you would prefer the 83 standard 02:04:52 like when using stutsk, i am stuck because it use swp instead of swap, and the swap has another effects 02:04:53 http://www.forthfreak.net/f83/index.html 02:05:05 I use it for my irc client :D 02:05:17 c00kiemon5ter: i met that when i use clojure 02:06:46 I haven't used forth much, but I've read a bit on it, and from I understand, Forth was not supposed to be standardized language where one would build libs and abstration on it, so that other programs could "benefit". It is the other way around 02:06:53 tangentstorm: i have checked negrovm's py version, can i call that a switch thread 02:07:25 i don't know 02:07:26 Forth was supposed to be build to solve a specific problem, and language adapts to the solution, not the solution to the language. It doesn't favour layers or abstraction 02:07:49 * tangentstorm is not an expert on what people can or can't call things :D 02:08:08 c00kiemon5ter: anyway you need to give an minimal core words, other wise , you need to impl everything you need like hashfunction and graph de/encoding 02:08:15 --- join: epicmonkey (~epicmonke@host-224-58.dataart.net) joined #forth 02:08:36 what i dislike is the core words is too many in ansi standards, the page number scared me 02:09:18 the 83 standard is much smaller. 02:09:19 yeah, including everything in the standard has been critisized a lot, and seems not be favoured 02:09:24 the 79 standard is smaller still. 02:10:16 does 83 standards use 16 bits or 32 bits address? 02:10:36 i don't know 02:10:40 i just linked to it 02:10:44 http://www.forthfreak.net/f83/index.html 02:10:50 probably 16-bit though 02:11:02 since there weren't very many 32-bit machines in 1983 :) 02:11:05 maybe even 8-bit 02:11:23 hrm. probably 16-bit though. 02:11:25 btw, I've sent some patches to stutsk for the build-system. stutsk wants boost, which is horrible imo :( It's on my todo to look into it more 02:12:12 * tangentstorm will stick to retro and pascal. 02:12:22 c00kiemon5ter: yes its horrible and just like it claim, it share the philosophy with php , so i even include md5 sha words in the core runtime 02:12:23 (also it's in my todo to read the pascal lesson) 02:12:34 For those wondering about different ways of implementing Forth, http://www.bradrodriguez.com/papers/moving1.htm has a list of some. 02:12:39 it's in my todo to edit it. 02:12:45 hey ttmrichter :) 02:12:58 ITC, DTC, STC, TTC, etc. are there. 02:13:00 c00kiemon5ter: will you rewrite it in pure c? 02:13:09 ttmrichter: very thanks :] 02:13:22 :P will see 02:13:57 aha this article blame forth people 02:14:14 yunfan: Which article? 02:14:30 ttmrichter: the one you just give me 02:14:43 Everyone in the Forth community talks about how easy it is to port Forth to a new CPU. But like many "easy" and "obvious" tasks, not much is written on how to do it! 02:15:05 Ah, right. 02:15:29 i am interesting of porting them on python vm and maybe lua vm 02:15:32 I had to implement my first Forth by reading the "Threaded Interpretive Languages" book. 02:15:51 There's a 40-line Forth implementation in Lua out there already. 02:16:06 yeah thats' the miniforth we were looking at 02:16:14 its not based on vm , i know you are talking miniforth 02:17:03 if you ported it on these vm, you could share the efficient by those JIT tech 02:18:01 Oh you mean like bootstrap from the python virtual machine, but not use python itself? 02:18:14 Writing to the Lua VM directly is ... dubious. It's not documented well and it changes with the wind. 02:18:16 or lua/java? 02:18:43 python's is well documented but it does change between versions... at least between 2.x and 3.x 02:18:52 nope it dont change 02:19:04 i have just tested it last week 02:19:28 py2.7 and py3.1 generated the same vm bytecode 02:19:47 but the actual instructions changed between 2.7 and 3.0 02:19:59 but its ugly they have a variable lenght system 02:20:02 perhaps they just renamed them 02:20:32 yunfan: You do realize that most ISAs are variable-length, right? :D 02:20:39 maybe they just add some new OP and remove some 02:20:52 ttmrichter: yes, but i am a big fans of MIPS 02:21:40 * yunfan have an nanonote in 800RMB(~150USD) 02:22:05 I'm a little fan of MIPS. 02:22:15 I like it primarily because it's the underdog. :) 02:22:40 oop 02:23:44 yes its. but i heard that morden x86 arch runs on an low level RISC core via hardware translate or microcode 02:26:04 Yes. 02:26:19 The modern x86 is the ultimate victory of RISC. 02:26:23 tangentstorm: just have an idea, a multi modes system like miniforth could help to implement small lang in the runtime , like string format and regex 02:27:24 you could make a new mode like string-format when you met 1 2 3 format "i have 3 number , they are %d, %d, %d" 02:31:09 yeah but you can do that with a function too 02:32:02 the mode thing would be more like if you compiled the format string. 02:32:48 like say you had the string: "the numbers are: %d, %d, %d," 02:33:12 you could have dictionary entries for each word/token 02:33:26 yep 02:33:40 "the" , " ", "numbers", "are:", "%d", "," 02:34:28 then the string might be compiled as 00 01 02 01 03 01 04 05 01 04 05 01 04 05 02:35:01 in normal execution mode if you tried to "run" this string it would probably do something crazy 02:35:23 but in "template" mode when it got to 04 ("%d") it would know to pop a number off the stack and print it. 02:35:38 and all the other ones would just look up symbols in the dictionary and print their names 02:36:09 but then in "match" mode, it might work like a validator on input, to see if the user actually typed 'the numbers are 5, 38, 77' or something 02:36:28 and then it would ignore all the words except the %d ones 02:36:38 which would read a number from input and put it onto the stack. 02:36:59 at least... that's how i understood what he was talking about. 02:37:24 so this could prevent you from execution sequence of all possible input detects func 02:39:15 Like input validation? 02:39:39 yes 02:40:07 in normal flow, you need first detects if its number 02:40:20 then words, then throw exception 02:40:48 Yeah. I'm working on a parser generator right now, so my mind is on parsing. :) 02:40:51 when you add more and more runtime syntax, it became more and more 02:41:27 but this mode ideas would let the parse works under the stat machine concepts 02:42:14 when your parse got the first char which is not in [0-9xb] then it wont be number 02:43:05 Yeah. 02:44:12 its just a trick and would increse the complex of intepreter, but people like rich runtime syntax 02:44:31 I'm thinking about sequences vs selections in regexps/parsers too... like /abcd/ vs /(a|b|c|d)/ 02:45:34 you could store them both as 'abcd' and just make sequence and selection different modes 02:45:47 so one could chain them together with AND and the other could chain them together with OR 02:46:20 I think I'm going to try and implement this. 02:46:32 if you have impl them, try to use it on web server as an powerful dsl 02:47:04 instead of the default `allow 0.0.0.0 deny 10.0.1.0` 03:37:09 --- quit: rixard (Quit: rixard) 03:37:24 --- join: dto (~user@pool-96-252-62-13.bstnma.fios.verizon.net) joined #forth 03:49:54 I've done some mips assembly and a basic pipelined mips processor in vhdl 03:50:10 that was one of the best courses I had in the university 03:52:28 MISC designs seem fun 03:52:48 and I guess greenarray chips are MISC ? 03:53:48 they have 32 instructions, i think... some of the instructions are rather complicated. 03:54:13 that does sound like a fun course. :) 04:05:54 I keep wondering why forth is only thought for low-level tasks? The non-existent syntax gives power to implement any kind of scripting system. 04:08:37 accident of history? 04:20:00 --- join: protist (~protist@126.172.69.111.dynamic.snap.net.nz) joined #forth 04:22:16 I believe that too. However one place where forth can be found is in bibtex. It was my second encounter with forth. First was starting forth book from used book store 04:23:27 --- quit: dto (Remote host closed the connection) 04:43:54 --- quit: impomatic (Ping timeout: 260 seconds) 04:46:03 Vuokko: you believe what?...i just got here 04:46:44 14:05 < Vuokko> I keep wondering why forth is only thought for low-level tasks? The non-existent syntax gives power to implement any kind of scripting system. 04:46:47 14:08 < tangentstorm> accident of history? 04:47:34 and we're quite different timezones 04:47:53 so don't worry about timestamps 04:48:02 yeah haha 04:48:29 it would seem if FORTH had gc, then it would find more widespread use 04:48:51 but that complicates implementation....ease of implementation is one of the strengths of FORTH 04:50:21 does forth even have a way to allocate and free memory? 04:50:36 not having a gc is part of forth, it doesn't have one by choice, not by accident afaict 04:50:37 ALLOCATE and FREE ? 04:50:38 tangentstorm: could be implemented pretty easy 04:51:43 crc recently added a memory management library called slices to retro, wich i haven't had a chance to investigate.. i think it's basically like allocate and free 04:51:45 c00kiemon5ter: RPL (reverse polish lisp) was a FORTH variant with gc...just interesting, not making a point 04:52:09 from that calculator? :) 04:52:18 tangentstorm: indeed sir :) 04:52:47 and also the requirement of having forth and then the other system isn't helping situation. if you have nice python thing and you want to use forth then it should be nice to say import forth and continue development from forth 04:52:49 yeah i liked what i read about that language. didn't realize it had gc. neat. 04:53:09 you can do that in pascal :) 04:53:41 you can implement a FORTH in the language of your choice...then use it :) 04:53:57 already working on that. 04:54:04 Vuokko: what langauge? 04:54:07 yeah. there's a retro implementation for python 04:54:07 language* 04:54:19 probably other forths out there too. 04:54:23 I'm writing forthish libray for Qt 04:54:25 i don't like things being Python based...it makes me sad 04:54:41 there's a forth for parrot. 04:54:44 Python seems like a broken Lisp to me 04:54:49 tangentstorm: cool :) 04:55:12 tangentstorm: forth on a vm makes a lot of sense....esp if the vm is close to a canonical stack machine 04:55:22 tangentstorm: how good of a fit is parrot for FORTH? 04:55:26 parrot is not a stack machine. 04:55:31 tangentstorm: :( 04:55:42 JVM would make sense 04:55:58 not endorsing Java...just saying it could be a good FORTH target 04:56:47 IIRC this was talked in c.l.f and JVM was thought too limited to run natively forth 04:56:54 RogerTheGreat has a forth upon jvm, he calls it Mako iirc 04:56:56 that was the whole point of parrot. implement a register based machine with a continuation based execution model... the theory was that this would speed up scripting languages like python and perl. 04:57:23 jvm <- mako <- mako-forth 04:57:53 Vuokko: what is c.l.f? 04:58:02 comp.lang.forth ? 04:58:11 the news:// group 04:58:19 ah 04:58:37 too limited to run FORTH?...seems odd 04:59:04 jvm has a lot of restrictions and typechecking. 04:59:10 ewww. 04:59:48 you can't use it to get around the java security sandbox or whatever. 06:20:26 --- quit: protist (Quit: Konversation terminated!) 08:11:38 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 08:35:31 --- join: impomatic (~digital_w@87.115.210.249) joined #forth 08:36:43 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 08:39:40 --- quit: kumul (Ping timeout: 256 seconds) 08:52:11 --- join: Tod-Work (~thansmann@50-202-143-210-static.hfc.comcastbusiness.net) joined #forth 09:01:40 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 09:04:36 --- quit: kumool (Ping timeout: 256 seconds) 09:06:47 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 09:09:08 --- quit: kumul (Ping timeout: 256 seconds) 09:41:53 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 09:44:34 --- quit: kumool (Ping timeout: 256 seconds) 10:06:50 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 10:09:12 --- quit: kumul (Ping timeout: 256 seconds) 10:12:41 --- quit: carc (Ping timeout: 245 seconds) 10:12:52 --- quit: kumool (Ping timeout: 264 seconds) 10:18:16 --- join: carc (~carc@unaffiliated/carc) joined #forth 11:09:14 --- join: ncv (~quassel@unaffiliated/neceve) joined #forth 11:09:33 --- quit: epicmonkey (Ping timeout: 258 seconds) 12:19:11 --- join: epicmonkey (~epicmonke@188.134.41.112) joined #forth 12:41:30 --- join: dto (~user@pool-96-252-62-13.bstnma.fios.verizon.net) joined #forth 12:45:10 --- quit: dto (Remote host closed the connection) 12:46:07 --- join: RodgerTheGreat (~rodger@97-88-148-117.dhcp.mrqt.mi.charter.com) joined #forth 12:47:53 --- join: dto (~user@pool-96-252-62-13.bstnma.fios.verizon.net) joined #forth 12:53:32 --- quit: dto (Remote host closed the connection) 12:58:39 --- quit: nighty^ (Read error: Connection reset by peer) 12:59:45 --- join: Onionnion (~ryan@adsl-68-254-161-22.dsl.milwwi.ameritech.net) joined #forth 13:00:10 --- join: nighty^ (~nighty@tin51-1-82-226-147-104.fbx.proxad.net) joined #forth 13:06:45 --- join: dto (~user@pool-96-252-62-13.bstnma.fios.verizon.net) joined #forth 13:10:05 --- join: Tech_ (027bc0d3@gateway/web/freenode/ip.2.123.192.211) joined #forth 13:12:09 Hello all, I'm currently learning FORTH to play a mod in minecraft called Redpower 2. My goal is to eventually write an assembler in FORTH (Combining what I'm learning at college right now) to program the emulator ingame. Right now though I'm having trouble with DO LOOPs. 13:12:31 My code is basically: 13:12:57 16 0 DO 2 DUP . LOOP 13:13:08 Which doesn't work as expected 13:13:45 is there a reason you want 16 copies of the number 2 on your stack? 13:14:28 To figure out how to use loops 13:14:45 I'm learning right now, I know C and I've dabbled a bit with asm in class 13:14:54 But FORTH is somewhat alien to me 13:16:06 well OK, how is the behavior of DO differing from what you expect 13:16:36 It's only printing the 2 once in the interpretter 13:16:56 I'd expect 16 sets of 2 13:17:21 Because the dot operator, from my understanding.. pops and prints 13:17:51 are you aware that control structures generally must be used within a colon definition? 13:18:15 Yeah, so far this is defined as a new word called Looptest 13:18:30 how about you pastebin your entire program 13:20:51 I'll write out what I was trying to do originally since my loop worked just there 13:20:59 Not be a moment 13:25:32 --- quit: dto (Remote host closed the connection) 13:30:23 http://pastie.org/7591223 13:34:52 are you sure 40 @ TICKS does what you think it does? 13:37:22 --- quit: Nisstyre (Quit: Leaving) 13:37:51 Pretty sure yeah 13:37:58 Might test that command on its own 13:38:34 http://ibm5100.net/redpower/forth-2/ <- this says TICKS just takes a number of 20ths of a second 13:38:41 you 13:38:50 you're dereferencing the cell at address 40 13:39:34 Ohh 13:39:42 presumably that contains *some* number but I don't see why you would be getting a tick count from there 13:39:54 Yeah... 13:39:56 That doesn't seem right 13:40:36 let me know if you can get that working and then I have some suggestions for simplifying your code 13:41:11 Okay. 13:46:54 That fixed it 13:47:25 alright, then let's talk a little about factoring 13:47:47 in Forth, you should try to break your programs into small procedures which do one thing 13:48:18 your program currently uses a global variable and everything is in one procedure 13:48:58 every time you go around the loop, you left-shift a counter and then strobe an IO line for a short period 13:49:59 what if you broke that out into a word, like this: 13:50:01 : strobe dup IOXSET 40 TICKS IOXRST ; ( flag -- ) 13:50:45 then you could directly test 'strobe' pretty easily- just try a few inputs and make sure it works as expected 13:50:59 Yeah. 13:51:05 and breaking out that word makes it possible to simplify 'sequence' as well: 13:51:12 : sequence 1 16 0 DO dup strobe 2 * LOOP drop ; ( -- ) 13:51:19 I think I need to looking into how to make argument lists 13:51:28 Then I could define the time in ticks to strobe too 13:51:36 argument lists? 13:51:51 In C you give functions arguments which it uses 13:52:12 in forth, arguments to words flow on the stack 13:52:13 int add ( int a, int b) 13:52:15 as do return values 13:52:24 Ohh okay. 13:52:32 So is the stack my local variables? 13:52:34 my definition of 'strobe' takes an argument from the stack 13:52:53 the stack can be thought of like that, yes 13:53:11 the comment ( flag -- ) is a 'stack picture' 13:53:48 the part before -- is what the stack should look like before the procedure is called, and the part after that shows how the stack looks when the procedure exits 13:54:04 this is strictly a comment, but it is considered good style to provide them 13:55:54 Okay so that duplicates from the stack for the first flag, then uses up the original flag on the reset. Leaving the flag missing on returning from the procedure 13:56:08 yes 13:56:47 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 13:56:48 and in 'sequence' I make a copy of the flag each time to pass into 'strobe' 13:58:24 there are a number of equivalent ways to write the same program which place dups and drops in different places, but the factoring I've written will make the word compose well 13:58:46 --- join: Tech__ (027bc0d3@gateway/web/freenode/ip.2.123.192.211) joined #forth 13:58:52 Sorry, chat went weird there 13:59:05 I would highly recommend you read a good introductory text such as http://www.forth.com/starting-forth/sf1/sf1.html 13:59:26 Okay :) 13:59:31 if you try to write forth as if it were C you will have a very unpleasant time of things 14:00:13 --- quit: Tech_ (Ping timeout: 245 seconds) 14:00:21 Yeah, it seems totally different so far. I quite like the simplicity of it though, feels more low level and less tangled for some reason 14:00:57 forth is, in my opinion, much more appropriate for any sort of embedded or process control application than C 14:00:59 i supposed i should be happy "Starting FORTH" is online. though it's more charming in print 14:01:10 bluekelp: truth 14:01:13 ...and it's all i have as reference to build my own kernel :) 14:01:37 I think it would be nice if there was a decent PDF version for offline reading, but I have a dead-tree copy already 14:03:20 Tech__: the forth memory model is much more straightforward than C. C makes it very unclear which values are in registers, on the stack, global, etc, and thus there are all sorts of implicit dereferences and things. In forth you just have values which you explicitly interpret as addresses to dereference or as value 14:03:26 *as values 14:03:30 --- quit: malyn (Quit: Disconnecting from stoned server.) 14:03:47 --- join: malyn (~malyn@unaffiliated/malyn) joined #forth 14:03:49 Okay, so memory is tape in forth 14:04:15 You're either the line number, or the content 14:04:17 one could argue that neither of these views of memory are strictly true on modern machines but at least the forth one is simpler and more consistent 14:11:25 --- join: ASau` (~user@p5797EF08.dip.t-dialin.net) joined #forth 14:12:43 --- quit: Tech__ (Ping timeout: 245 seconds) 14:14:16 --- quit: ASau (Ping timeout: 252 seconds) 14:19:31 --- quit: ncv (Remote host closed the connection) 14:21:07 hey, spiffy, my chip8 emulator seems to be working now 14:22:02 now to see if it can handle pong 14:27:20 --- quit: epicmonkey (Ping timeout: 258 seconds) 14:32:14 --- join: dto (~user@pool-96-252-62-13.bstnma.fios.verizon.net) joined #forth 14:36:51 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 14:38:44 --- join: epicmonkey (~epicmonke@188.134.41.112) joined #forth 14:39:16 --- quit: kumool (Ping timeout: 264 seconds) 15:11:46 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 15:14:29 --- quit: kumul (Ping timeout: 258 seconds) 15:17:04 --- join: ncv (~quassel@unaffiliated/neceve) joined #forth 15:44:00 --- quit: epicmonkey (Ping timeout: 258 seconds) 15:49:24 --- quit: ncv (Remote host closed the connection) 15:56:53 --- quit: Tod-Work (Quit: Leaving) 15:58:08 --- join: Nisstyre-laptop (~yours@oftn/member/Nisstyre) joined #forth 16:31:56 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 16:34:28 --- quit: kumool (Ping timeout: 264 seconds) 16:41:10 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 16:43:48 --- quit: kumul (Ping timeout: 258 seconds) 17:01:13 --- join: I440r (~mark4@2600:100a:b113:9bf1:5db8:4a10:106d:12f9) joined #forth 17:30:17 --- quit: impomatic (Quit: http://corewar.co.uk) 17:37:00 --- quit: I440r (Quit: Bye) 17:37:49 --- join: mark4 (~mark4@71-85-195-85.dhcp.stls.mo.charter.com) joined #forth 19:12:17 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 19:12:52 --- quit: kumool (Ping timeout: 264 seconds) 19:13:49 --- quit: kumul (Client Quit) 19:38:19 --- quit: dto (Remote host closed the connection) 19:58:26 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 20:34:45 huzzah: https://github.com/JohnEarnest/Mako/blob/master/demos/Chip8/Chip8.fs 20:41:08 * tangentstorm learns all about CHIP-8 20:43:39 it's fun stuff 20:56:46 --- join: kumool (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 20:59:40 --- quit: kumul (Ping timeout: 264 seconds) 21:11:39 --- quit: Onionnion (Quit: Leaving) 21:16:04 http://fatiherikli.github.io/brainfuck-visualizer/ 21:16:07 --- quit: mark4 (Remote host closed the connection) 21:16:22 RodgerTheGreat: does mako has android version and could call android api? 21:16:59 mako is a sandboxed VM and is not intended to expose the capabilities of the underlying OS/environment 21:17:16 there is an android port of Mako, though 21:17:19 a J2ME one too 21:17:31 and also ports in C and Factor I think 21:17:52 well cant it suport device like retro? 21:17:55 RodgerTheGreat: Got an URL to the Mako for Android? 21:18:50 ttmrichter: at present it's pretty ramshackle and mainly just supports the nexus 7, because that is the device I have to test with: https://github.com/JohnEarnest/androidMako 21:19:05 Thanks. 21:19:35 i think a forth for android which could call android api could save time for developing small tool like todo, notepad 21:19:36 ttmrichter: it was sort of a side project between me and an old coding buddy 21:20:01 yunfan: maybe, but that isn't really at all what mako is meant for 21:20:39 RodgerTheGreat: author couldnt see everything :] 21:21:30 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #forth 21:23:02 --- join: beretta (~yaaic@cpe-107-8-120-203.columbus.res.rr.com) joined #forth 21:24:00 --- quit: kumool (Ping timeout: 258 seconds) 21:33:57 --- quit: kumul (Read error: Connection reset by peer) 22:21:37 --- quit: RodgerTheGreat (Quit: RodgerTheGreat) 22:51:47 tangentstorm: what do you teach in school? 22:53:32 I used to be a reading tutor for little kids, and I taught english as a second language for a while, but I'm not a professional teacher. 22:53:58 I'm just making a game programming course. http://gamesketchlib.org/ is the old java code. 22:54:17 (there are some videos up there too) 22:59:14 --- join: impomatic (~digital_w@87.115.210.249) joined #forth 23:03:01 sorry, i cant remember what i want to say at that time 23:21:21 is there any digital computer made with mechanic components like gears 23:23:19 yunfan: like a Babbage Engine? 23:24:37 maybe i should add another limits: general purpose 23:24:43 just like those 8 bit chip 23:24:47 There's some made in Lego. 23:25:26 http://www.youtube.com/watch?v=i_u3hpYMySk 23:30:34 when i read the book " the pattern on the stone", the author says he has built an computer using level 23:30:49 which made me very interesting 23:31:47 level? 23:32:50 pretty cool, ttmrichter 23:33:09 ttmrichter: any news on your ga144 idea? 23:34:17 oop, its lever 23:34:25 an phisical tool 23:35:34 i like the note from fallout 23:36:02 which let me think if i met such situation, how could i build an computer for enhanced myself :] 23:37:23 and recently the tv show "revolution" also shows when electy lose suddenly, what out would could turn to 23:37:27 tangentstorm: It's on the queue of ideas to consider while we work on our first project. 23:45:43 * tangentstorm has plenty of idea-queues lying around :) 23:46:27 oh danny hillis wrote that pattern on the stone book. he's made some cool stuff. 23:47:19 http://museum.mit.edu/nom150/entries/1215 <- that's the computer you're talking about? 23:50:46 this is like a ASIC 23:51:23 but i really interesting is a general purpose digital computer made without morden electry tech 23:51:33 i think any physical "general purpose" 8 bit cpu will be very large. 23:51:55 yes 23:52:22 oh you mean components but not "non-electrical physical parts"? like shifters and buffers and such? 23:53:01 no, i mean all, have you watched the tv show "revolution" 23:53:11 the first apple was TTL, i think. not sure if that's what you want. for a "gear only" sort of thing - i'm not aware of any 23:53:18 from NBC 23:53:19 i don't have/watch tv :) 23:54:21 not only gear, you could use lever, flow or other low tech components 23:55:32 --- nick: ASau` -> ASau 23:55:45 i'm not aware of any. it's quite a project. 23:55:52 but i think a gear based computer will reduce the number of logic gates 23:56:21 it could be hex digital based 23:56:54 could be. it'd operate very differently from a binary/digital computer 23:57:04 so that for a 8bit computer , you only need 2 machine word in this gear computer 23:59:59 --- log: ended forth/13.04.15