00:00:00 --- log: started forth/04.06.25 00:20:39 --- join: solar_angel (~jenni@Toronto-HSE-ppp3685160.sympatico.ca) joined #forth 00:28:31 --- join: lalalim_ (~lalalim@p508ABAC5.dip.t-dialin.net) joined #forth 00:41:34 --- quit: lalalim (Read error: 110 (Connection timed out)) 00:46:40 --- quit: zardon_ (Read error: 110 (Connection timed out)) 00:55:20 --- join: doublec (~doublec@gprs.vodafone.net.nz) joined #forth 01:15:04 --- quit: doublec () 01:37:23 --- quit: topher ("Client Exiting") 02:06:52 --- quit: Herkamire ("bed") 02:44:39 --- join: qFox (C00K13S@cp12172-a.roose1.nb.home.nl) joined #forth 03:12:23 --- join: aum (~aum@port-204-54-210.fastadsl.net.nz) joined #forth 03:32:18 --- join: Topaz (~top@spc1-horn1-6-0-cust217.cosh.broadband.ntl.com) joined #forth 03:57:06 sweet, getting wxForth working 03:57:16 wxForht! 03:57:22 that sounds cool 03:57:33 can you give me a url to it? 03:57:45 hey, i've only just got a test prog working 03:57:51 will be a while b4 i publish 03:58:03 oh, you're writing it! even cooler! 03:58:27 i've been building 'forpy' - a fork of FICL-forth that interfaces with the Python API 03:58:53 and am working on some Forth words for building, instantiating, subclassing, accessing Python classes 03:59:22 so a kinda roundabout journey - forth -> python -> wxPython -> wxWindows 04:00:46 wow, it interfaces with python? 04:00:49 that's... interesting. 04:01:16 well, i love python, it's got a really cushy 'as-you-like-it' oop model, and a great api 04:01:17 my FORTH environment stands alone. 04:01:28 solar_angel: no it doesn't 04:01:36 no it doesn't? 04:01:42 solar_angel: a REAL forth environment doesn't even need the hardware! 04:02:01 aum - you're talking to a chip designer who's in the process of designing chips to run her FORTH environment on 04:02:09 like i said, my FORTH environment stands alone 04:02:17 solar_angel: faaarrrrrrrrrrk!!! :)) 04:02:32 ? 04:02:36 solar_angel: the Forth community will hail you as a Godess, and celebrate your birthday 04:02:41 lol 04:03:11 solar_angel: will you get manufacturer support to tool up and scale up a good prod run? 04:03:31 i'm not rich... looking at FPGAs for implementation at present. 04:03:47 * aum would be delighted to have a Forth PCI card 04:04:38 solar_angel: have you been doing Forth for long? 04:04:57 depends what you mean by FORTH. 04:05:04 FORTH itself, not really... under a year, probably. 04:05:10 stack-based languages... that's another story 04:05:59 i invented my first one back in... '95 or 96, i think. 04:06:33 solar_angel: that's impressive 04:06:48 i suppose. 04:06:49 so how did you feel switching from your own thang to the world of Forth? 04:07:07 it's not all that much different, honestly... especially since my FORTH isn't anywhere remotely near ansi 04:07:15 what forth is ?!? 04:07:21 point.' 04:07:39 well, several Forths try to do the ANS Core+Ext 04:07:56 mine doesn't even try to be ans. 04:08:11 I hacked FICL-forth, so now in addition to the usual param/return/float stacks, it's got a separate stack for python objects 04:08:14 it uses nul-terminated strings, for one thing :P 04:08:20 now that's odd :) 04:08:29 have you played with python? 04:08:34 i wrote a forth-like calculator once, as a test for the C++ standard library i was writing.... 04:08:48 it was odd, because it had arbitrary-precision integers on the stack 04:08:57 well done! 04:08:59 yes, i've used python. i used to do a fair bit in it 04:09:11 i massively like Python's OO paradigm 04:09:23 it's kinda cool. 04:09:33 i've been working on an OO extension in my forth. 04:09:52 i feel there's a slight impedance mismatch between forth and oo 04:10:00 hard to blend them in a way that feels good 04:10:04 not necessarily. 04:10:22 see, i already have a dictionary/vocabulary system that approximates OO already. 04:10:31 there's an OO extension in FICL-forth, but it's painful 04:10:33 it's just a matter of hooking it in. 04:10:58 i've done a callback wrapper that allows Python methods to be implemented in Forth 04:11:05 cool. 04:11:32 i'm trying to rid myself of my last external dependancy 04:11:35 haven't implemented python locals yet, so the stack manipulation is frying my brain 04:11:38 i'm still reliant on nasm. 04:11:43 ahh, ok 04:12:02 so you want your Forth system to spit the raw binary? 04:12:26 i want to be able to reassemble my core from inside itself. 04:12:46 but for a given platform, you've got to 'boot' your forth onto it somehow 04:13:00 sure. that's where you cross-assemble. 04:13:04 i'm not quite to that point yet. 04:13:06 but it's close 04:13:29 any chance of a linux kernel replacement, with drivers, by Thursday next week? 04:13:37 * aum ducks 04:14:00 i don't see a point in replacing the linux kernel... 04:14:21 slightly more seriously - are you building a graphical toolkit 04:14:21 ? 04:14:33 but Cy/VOS boots quite nicely on most hardware, and supports memory management, floppy drive, pic, pit, dma, pc speaker, rs232, keyboard, psaux, vgacon, vga... 04:14:49 nic? 04:14:54 tcp stack? 04:15:07 not quite yet... i'm adding interrupt support to my serial driver at the moment... 04:15:19 i have my dev box cabled into a Cisco 2502 through both serial ports 04:15:27 right 04:15:31 RFC1055 is on my immediate todo list 04:15:43 do you find you're getting comfortable leverage? 04:16:05 leverage? 04:16:24 well, layers of abstraction which eliminate menialities 04:16:51 it's not too bad. i spend less time actually implenting code than i do designing. 04:17:01 or reading up on bizarre PC hardware 04:17:04 that's a good place to be 04:17:14 exactly. 04:17:33 once in a while an odd hardware peculiarity snags me for a bit 04:17:37 trivial question - do you think local variables in Forth suck? 04:17:40 psaux is a right royal mess. 04:17:49 local variables? like, the LOCALS keyword? 04:17:55 i don't have them implemented. 04:18:15 so within your words, you do everything purely on the stacks? 04:18:27 pretty much 04:18:37 if i can't, i usually break it into a couple words 04:18:55 guess it would be comfy for you, since you've spent most of a decade in stack-based programming 04:19:26 mostly just toying around, except for the time i wrote a compiler that used a stack-based intermediate language... 04:19:44 the optimizer was a cool project... i still haven't added a comparable thing to my current FORTH system 04:20:01 most stack manipulation words compiled to zero assembly instructions. it was quite cool. 04:20:13 nice one 04:20:36 i rather liked it. 04:20:45 i've spent most of that time in C++, honestly. 04:20:57 i wrote an extensive standard library, starting in a time before stl existed. 04:21:04 totally different paradigm from forth 04:21:09 that's for sure. 04:21:20 my FORTH system doesn't have built-in templates for genetic algorithms :P 04:21:45 that brings up a thought - AI in Forth, or at least, neural nets 04:21:46 i go from writing a massive standard library to writing an OS that weighs in at 60k. 04:22:03 hehehe, my first neural net program was written in qbasic :P 04:22:15 it was odd, though, had a full mouse-driven GUI and everything 04:22:19 60k - that's good 04:22:33 takes me back to the 8-bit era 04:22:55 hehehe 04:23:03 the 8-bit era was a trip 04:23:21 i remember feeling in heaven after expanding from 4k RAM to 16k 04:23:39 yikers. i'm not that old, i started on a 128K machine. 04:23:58 still a 6502-based machine, though 04:24:05 my first machine - SC/MP processor, didn't even have CALL/PUSH/POP instructions 04:24:06 (for the most part... it also had a Z80, but it hardly used it...) 04:24:14 which machine was that; 04:24:16 ? 04:24:21 * solar_angel started on the C128 04:24:28 National Semiconductor SC/MP - 8-bit 04:24:38 took 3 machine instructions to emulate a CALL 04:24:43 oh. cute. 04:26:00 i guess the whole spirit of Forth is about breaking free from all dependencies on other software, right down to the bare metal 04:26:11 * solar_angel thinks she probably learned to read from the Commodore 128 Reference Manual. 04:26:20 lol 04:26:21 exactly :) 04:26:33 well, i'm actually being half-serious. 04:26:36 i started programming when i was 5. 04:26:42 eek 04:26:51 i thought i was an early starter at 13 04:27:00 i had already designed my first computer by then. 04:27:14 although it wouldn't have worked in the designed state, and would have costed a fortune... 04:27:29 i also had built my first computer-controlled robot (after reprogramming the 128's joystick port as an output device) 04:27:37 * aum wonders if DNA is (even partially) stack-based 04:27:48 and... um... probably built my boolean calculator as well. 04:28:24 not really.... DNA is a 3-unit tetranary code (base 64) 04:28:36 you must have been Alan Turing or similar in a previous life 04:28:40 it's more like massive parallel processing. 04:28:44 lol, why do you say that? 04:29:01 you've taken to programming like Mozart took to music 04:29:52 * solar_angel blushes. 04:29:59 well that has to be the nicest thing anyone's ever said to me. 04:30:06 surely not 04:31:01 do you get a hard time in life? 04:31:31 yes 04:31:47 how so, if you don't mind me asking? 04:31:55 a bunch of ways. 04:32:15 amongst other things, i'm autistic. and not exactly mildly. it makes functioning in this world a huge challenge. 04:32:41 i have Aspergers, so I (partially) know where you're coming from 04:33:16 *nods* lots of the brightest geeks are somewhere on the autistic spectrum. 04:33:28 i'm almost an extreme example of that, i guess. 04:33:56 must be tough relating to people in the physical world 04:34:24 it is. 04:35:04 do you feel connected to your emotions, or does that whole area feel a bit dead? 04:35:24 i'm quite well connected to my own emotions. 04:35:47 from what i can tell, it's mostly a misconception that autistic people *lack* emotion. it's more like we just have a totally different set of them. 04:36:02 i can't relate to neurotypicals at all. my partner is also autistic, though, and we relate perfectly. 04:36:18 different set of 'protocols' of emotional interaction? 04:36:47 that's a good way of putting it, yes. 04:37:07 i've never had much trouble relating to other autistics, and the internet has made finding others to interact with a lot easier 04:37:23 that'd be a god-send 04:37:29 it is. 04:37:57 could it be that autistics wire their brains, and write their neural microcode differently? 04:38:23 absolutely. 04:38:33 there are many things that autistics do a *lot* better than neurotypicals. 04:38:38 out of the ones i know, most are in either math or computers. 04:38:39 that's for sure 04:38:57 analytical disciplines, with objective parameters 04:39:00 exactly. 04:39:45 have you wondered what might cause one to structure one's brain in a way which neurotypicals label as 'autistic'? 04:40:02 well, that part seems like a birth difference. probably something genetic. 04:40:06 or, when in life this happens? in-utero? infancy? 04:40:58 a good example (and an odd one) is that autistics are born with smaller heads than neurotypicals, but have way more development of the brain after birth, ending up with substantially larger cranial diameters after 4 or 5 years. 04:41:31 it's just that i practise an alternative health therapy called 'Rebirthing', which seeks to promote better/deeper self-understanding 04:41:43 it goes along with my current theory that we have fewer instincts (less prejudice, less irrationality, etc, amonst other things) and more learned-behaviors than neurotypicals. 04:42:22 i've seen countless cases where people can set up major aspects of their existence from single experiences, even in the womb 04:42:34 (i've never met a prejudiced autistic who wasn't thoroughly brainwashed by propaganda, and even those would listen to reason...) 04:43:16 must be weird to look out at the mainstream world - seeing people who'd rather die than change a fundamental irrational belief 04:43:20 So. Whan will the sane take over? 04:43:37 aum: It isn't for you? 04:43:38 aum - *very* weird. 04:44:11 solar_angel: i feel that to a large extent, but i can certainly imagine the feeling would be greater for someone from a more autistic viewpoint 04:44:38 Robert - referring to what? 04:44:50 * aum thinks the sane will take over when people learn en masse to buy into a 'plus-sum game' 04:45:01 solar_angel: What is? 04:45:17 aum: What is that? 04:45:42 a 'plus-sum game' is a mind-set of abundance, the paradigm of 'there's more than enough for everybody' 04:45:57 * solar_angel smiles at aum. 04:46:03 a plus-sum game.. that would be quite something. 04:46:12 most of the world plays a 'zero-sum game' - the belief that if anyone has something, then one is automatically being deprived 04:46:33 or, a belief that the size of the pie is unavoidably limited 04:47:31 i've come to believe that the 'the root of all evil' is not the 'love of money', it's the fear of being without money 04:47:58 that is an astute observation. 04:48:10 although sadly, i don't think it's entirely correct. 04:48:20 the problem with society at the moment is an increasing concentration of wealth. 04:48:25 some of my clients are millionaires, with holes in their socks 04:48:53 some of my clients are on the bones of their asses, dirt-poor, but always find money for what they need, and manage to save and live well 04:49:59 tis one thing i'd like to ask actually, does anybody ever 'feel rich'?, or do people always think they need at least twice what they actually have? 04:50:18 i guess autistics might be less entrapped by the reptilian aspects of the mating drive - the need to find/control the most 'genetically viable' mates at all costs 04:50:26 (when compared to the rest of the (global) population, they're extremely wealthy) 04:50:45 Topaz: Nigerians are the world's happiest people 04:50:54 * Robert looks at aum 04:50:58 and I'm not referring to the 419 spammer/scammers 04:51:43 one measure of wealth - how long you can cease work for before worrying about money 04:51:51 exactly. 04:51:56 i feel comfy now. 04:52:00 i don't work. i like it this way. 04:52:12 i don't work outside of writing a FORTH-based OS, anyway. 04:52:15 but that's fun. 04:52:18 aum: Then everybody could we wealthy - just not at the same time. 04:52:21 be* 04:52:29 what will this OS run on? 04:52:37 Topaz - it already runs on x86 PC's. 04:52:43 i'm in the process of a couple other ports 04:52:47 ooh, fun fun 04:52:48 mostly waiting on development systems. 04:53:24 Topaz: Do you ever play strategy games? 04:53:32 a forth-based pxt cellphone would be leet 04:53:52 pxt? 04:54:06 camera cellphones 04:54:09 Robert: occasionally, though i haven't played any computer games in ages 04:54:20 (for a start, most won't run on linux ;) 04:54:30 i'm overdue to walk the dog - back approx 20 mins... 04:54:33 i like red alert, though i'm no good at it 04:55:17 strategy games are fun. 04:56:10 solar_angel: if you want to keep in touch, my email is david@freenet.org.nz, feel welcome to drop me a line 04:57:03 i'm constantly in this channel anyway. 05:04:18 Topaz: Me neither. But you can never have too much defense for your base, right? No matter how much you have, you don't feel really secure. 05:08:12 well, depends :D 05:08:17 but i see what you mean 05:24:09 :) 06:28:00 aum: wxForth url? 06:29:54 --- join: madwork_ (~madgarden@derby.metrics.com) joined #forth 06:59:57 --- quit: Topaz (Remote closed the connection) 07:00:03 --- join: segher (~segher@blueice4n1.de.ibm.com) joined #forth 07:07:23 --- quit: solar_angel ("later") 07:15:45 --- join: squire (~vikas@202.142.105.254) joined #forth 07:16:46 after learning lisp I wrote better C code, after learning a bit of forth I write better Lisp code 07:31:24 --- join: wossname (wossname@HSE-MTL-ppp60177.qc.sympatico.ca) joined #forth 07:44:43 --- quit: squire (Read error: 104 (Connection reset by peer)) 07:57:36 :) 07:57:44 erm he left 07:58:21 I found one hit on google for wxForth, and it was a log from this channel in 2002, asking about wxForth. 08:01:34 hehe 08:07:39 ;) 08:09:40 first disk done, yay 08:20:36 hi 08:20:52 hi 08:20:56 * arke is just using glue and tape and paper 08:20:59 Hi slava 08:21:00 * arke is building a tesla turbine from paper 08:23:26 I can't remember what the inner hub diameter is on a 5.25" HD, but the media surface would be great. And being aluminum, cutting the exhaust ports shouldn't be too hard. 08:24:01 ;) 08:24:09 * arke has 2 disks cut out 08:24:15 * arke starts on the third 08:26:53 --- join: tathi (~josh@pcp02123722pcs.milfrd01.pa.comcast.net) joined #forth 08:42:22 --- quit: segher ("Leaving") 08:47:12 --- join: solar_angel (~jenni@Toronto-HSE-ppp3685160.sympatico.ca) joined #forth 08:53:39 --- join: topher (~chris@lsanca1-ar42-4-61-175-184.lsanca1.dsl-verizon.net) joined #forth 09:02:17 --- quit: tathi ("leaving") 09:07:36 sometimes, vim *really* pisses me off. I'm toggling between two files, comparing some differences. And half the time this brain dead program doesn't remember the screen position of where it was. And there's no consistency to it, that I can find. Well, other than not working right when I really need it. 09:07:57 why not use vimdiff? 09:08:05 or screen? 09:08:16 Because yank buffers don't work across screen. 09:08:24 use vimdiff then 09:08:26 I dunno about vimdiff. Never heard of it. 09:08:33 man vimdiff 09:08:36 it works :) 09:10:04 So it does. Now, how the hell to actually move differences back and forth... 09:10:29 i forget, but there's a couple commands for it 09:10:34 try :help diff 09:11:19 --- quit: topher ("Client Exiting") 09:53:33 --- quit: solar_angel ("*later*") 11:36:03 --- quit: fridge (Remote closed the connection) 11:36:04 --- quit: madwork_ (Read error: 54 (Connection reset by peer)) 11:55:00 --- join: proteusguy (~proteusgu@69.79.24.31) joined #forth 12:35:16 --- join: ASau (~asau@158.250.48.204) joined #forth 12:35:23 Dobryjj vecher! 12:35:40 --- join: Topaz (~top@spc1-horn1-6-0-cust217.cosh.broadband.ntl.com) joined #forth 12:35:56 Dobryjj vecher, Topaz! 12:37:39 er, hi :) 12:37:51 Privet, ASau :) 12:42:23 God kvael! 12:43:47 kvaell* :) 12:44:36 OK. 12:44:49 Anything new? 12:45:02 I've made my diploma. 12:45:32 Now I'm (relatively) free. 12:46:14 I may afford one or two free months. 12:47:22 Cool! 12:47:30 Congratulations, ASau :) 12:47:57 How is it called in English? 12:48:00 Ph. D.? 12:48:20 Not sure, that's one title... 12:49:31 Anything new from crc? 12:49:49 Has he seen hacked c-forth? 12:50:47 Don't know 12:51:11 Well, I can wait for him. 13:26:49 --- quit: wossname (Read error: 104 (Connection reset by peer)) 13:27:21 --- nick: lalalim_ -> lalalim 13:54:32 --- join: Herkamire (~jason@h000094d30ba2.ne.client2.attbi.com) joined #forth 14:03:50 God kvaell, Herkamire! 14:05:33 hi ASau :) 14:06:23 What's new? 14:06:42 Where's crc? 14:51:03 --- quit: cmeme (Read error: 54 (Connection reset by peer)) 14:51:23 --- join: cmeme (~cmeme@216.184.11.30.unused.swcp.com) joined #forth 14:51:23 --- join: cmeme2 (~cmeme@216.184.11.30.unused.swcp.com) joined #forth 14:53:17 --- quit: cmeme (Remote closed the connection) 14:53:17 --- quit: cmeme2 (Read error: 104 (Connection reset by peer)) 14:53:58 --- join: cmeme (~cmeme@216.184.11.30.unused.swcp.com) joined #forth 15:09:07 --- quit: cmeme (Read error: 54 (Connection reset by peer)) 15:20:23 --- join: cmeme (~cmeme@216.184.11.30.unused.swcp.com) joined #forth 15:21:02 --- quit: cmeme (Read error: 54 (Connection reset by peer)) 15:25:11 --- join: cmeme (~cmeme@216.184.11.30.unused.swcp.com) joined #forth 15:47:29 --- join: solar_angel (~jenni@Toronto-HSE-ppp3685160.sympatico.ca) joined #forth 15:52:40 --- join: SDO (~SDO@68.170.20.201) joined #forth 16:02:39 Good evening, solar_angel and SDO! 16:02:54 hi asau 16:03:21 Anything new? 16:03:51 I've been away for a week. 16:04:05 not sure... 16:04:10 some progress on my OS project 16:04:19 That's good. 16:04:28 solar_angel: what sort of os? 16:04:39 I have little progress in my optimizer. 16:04:42 Herkamire - FORTH-based OS for x86, and eventually for PPC. 16:05:18 i've been thinking about my optimizer a bit, and looking through the sources of my old one 16:05:36 I've almost coded Hooke-Jeeves' alg. in Scheme, and partially in Forth. 16:05:39 definately going to have to build one in soon. 16:05:48 hooke-jeeves? 16:07:47 R. Hooke, T. A. Jeeves, 'Direct search solution of numerical and statistical problems', J. Assn. Comp. Mach., 8, 212-219, 1061. 16:08:03 alright, what does it do? 16:08:13 :) 16:08:38 i implemented Brandenberg-Sporer a while ago too... 16:08:39 It optimizes function of several arguments. 16:08:45 i bet that means just as much to you :P 16:08:57 Hm. 16:09:08 Reference? 16:09:20 what do you need an optomizer for? 16:09:53 [3] Sporer, Th., et al, The use of multirate filter banks for coding 16:09:54 of high quality digital audio, 6th European Signal Processing Conference 16:09:54 v1 pp211-214, Amsterdam, 1992 (http://www.lte.e-technik.uni-erlangen.de/~spo/eusipco.corrected.ps) 16:09:56 Nonlinear fit. 16:10:31 amsterdam! nl! 16:11:07 And main thermodyn. problem. 16:11:42 Link does not work. 16:11:49 probably not. *shrugs* 16:11:52 it was just a reference i found 16:11:58 i think i've got the ps file around somewhere... 16:12:24 May I ask you to send it by e-mail? 16:12:36 asau at hotbox dot ru 16:12:44 i'd have to actually find it. 16:12:58 it's basically an efficient implementation of MDCT 16:14:10 Sorry, I don't know. 16:14:14 What's MDCT? 16:14:17 Simplex? 16:14:22 Modified Discrete Cosine Transform 16:15:28 How does it converge? 16:15:42 converge? 16:16:02 it's totally deterministic 16:16:09 there's only ever one solution to an MDCT or an IMDCT 16:16:12 Well. 16:16:39 Does it require differenciation? 16:17:22 Probably not. 16:17:37 But it requires integration, I think. 16:17:52 This is not good too. 16:17:56 no, actually, it doesn't. 16:17:59 Though it's better. 16:18:13 it's a recursively-expanded series expansion 16:18:16 Maybe, reference? 16:19:12 google has a few. or for simple explanation, it's very much like an FFT 16:19:36 with a few quirks that get around the edge problems and windowing issues in continuous streams. 16:19:59 I can't understand this language. 16:20:18 My problems are of quite another class. 16:20:25 I'm not EE. 16:20:38 *nods* you're doing numeric solving and optimization 16:20:45 which is a totally different set of problems 16:20:54 you're not converting to and from frequency domains 16:21:05 Right. 16:21:23 I don't have frequencies at all. 16:22:25 Thanks for the idea to try to google. 16:22:25 exactly. 16:22:32 sure 16:22:53 (trust me, the google links are *way* more approachable than the paper itself.) 16:26:25 That depends on your nearest library. 16:29:35 no, i don't mean findable. i mean approachable. 16:29:49 i mean you can sit down with the paper in front of you and be left less clueful than before you started 16:29:52 took me hours to decypher it 16:30:01 and i'm relatively skilled in this area 16:30:09 (no expert, to be sure, but not new either) 16:30:18 C gives you enough rope to hang yourself, think of Subversion as a sort of rope storage facility.? ?Brian W. Fitzpatrick 16:30:19 In the world of open-source softw 16:30:31 Forth gies you a way to hang yourself more efficiently with LESS ROPE! 16:30:52 lol!! 16:30:52 Dobryjj vecher, I440r! 16:30:54 LESS ROPE! 16:30:56 that was supposed to be IF C... 16:30:57 now that's brilliant 16:31:25 solar_angel, I can't agree. 16:31:34 ASau - can't agree with what? 16:32:02 the paper i pointed out didn't really explain the concepts of spectral density or what an MDCT is, just how to do one fast. 16:32:07 I've met more papers that were more clear than anything found with google. 16:32:12 sure 16:32:14 just not that one 16:33:46 Well, I can't imagine anything analogous to reference implementation in chemistry. 16:35:24 cool, you're in chemistry? 16:35:55 I've made diploma in chem. thermodyn. 16:36:02 cool 16:36:31 Why I need optimization is this. 16:36:53 Non-linear fit. Weighted least squares. 16:37:23 Solving main thermodyn. problem is minimizing Gibbs energy function. 16:37:40 Well, constrained actually. 16:37:45 *nods* 16:38:00 But you can go with Lagrange function. 16:38:02 wait... Gibbs energy function? 16:38:25 "How the stuff works." 16:38:26 oh ok, nevermind. 16:38:37 i knew the equation but not the name. 16:38:40 it's been a while 16:38:56 You measure thermodynamic properties (or thermochemical). 16:40:02 *nods* you're trying to make G small so that you can ensure the reaction is forward-biased. 16:40:27 Then you apply nonlinear fit: measured values to model function G(T, p, x_i). 16:40:28 yes? 16:40:39 No. 16:40:42 ohhhh 16:40:45 now that's interesting 16:40:48 i misunderstood :) 16:42:22 When you fix T and p, you have x (molar ratio of components) for G to be minimal. 16:42:45 ahhh 16:43:05 you're trying to find the optimal temperature, pressure, and concentration for a reaction? 16:43:15 So when you minimize G(x) you find equilibrial concentrations. 16:43:22 *nods* 16:43:40 ohhhhh, so then you know your K. 16:43:40 interesting 16:43:54 * solar_angel is really rusty on chemistry. 16:44:20 hi all 16:44:28 Hi slava 16:44:33 Privet, slava! 16:44:56 how goes? 16:45:32 ASau - i now think i see what you're using the optimization algorithm for. fascinating :) 16:48:28 hi all 16:48:37 Actually the final result is either phase diagram or stability diagram. 16:49:03 Good evening, aum! 16:49:11 morning here 16:49:35 Soon it will be morning here too. 16:49:44 i wish i could force GCC to store certain globals in registers 16:49:52 ASau: how's summer in the uk? 16:49:59 ??? 16:50:07 I've never been in UK. 16:50:09 i don't think ASau is in uk :) 16:50:28 ASau: if it's morning soon where you are, that'd put you in uk or similar timezone 16:50:49 oh, i forgot - daylight saving in EU 16:51:00 Russia, Russia. 16:51:11 ahh, ok 16:51:11 Hehe. 16:51:23 What city, ASau? 16:51:26 * Robert forgets 16:51:30 Robert: london 16:51:43 because ASau is in uk right ;) 16:51:44 Moscow. 16:51:54 Ah, OK. 16:52:01 So close 16:52:34 anybody know implementations of stop© gc in forth? 16:54:00 gc in FORTH? that's just... wrong... :P 16:54:19 with 'does>', how do i convert the thing on the stack to the new word's name? 16:54:31 solar_angel, that depends on problem, not on language. 16:54:43 ASau - i know, i know. it's still wrong :P 16:54:49 aum, NFA 16:54:54 solar_angel: i'm porting my interpreter to C 16:55:03 FIG: CFA NFA 16:55:08 so i'll need some kind of gc 16:55:11 slava - oh. well, that'll be interesting. 16:55:35 solar_angel: its not a 'real' forth since there are datatypes and pointers are tagged (low 3 bits); so it 'knows' the type of eveything in the heap 16:55:39 so gc makes sense 16:55:53 cute 16:56:04 well, ok, you can get away with that. 16:57:57 slava, how do you mark used objects? 16:58:20 is there a version of 'create' that doesn't parse a word from input stream, but instead gets this word from stack as ( addr u -- ) ? 16:58:24 Well, how do you store your objects, first. 16:59:46 aum, that's called HERE HERE SWAP CMOVE HERE C@ 1+ ALLOT LATEST @ , LATEST ! smth , 17:00:00 See CREATE implementation. 17:00:25 ASau: thx 17:01:26 ASau: i just ALLOT them as usual 17:01:41 ASau: if an object is not reachable via tagged pointers originating from the user environemtn, then its garbage 17:03:00 Do not ALLOT 17:03:05 why not? 17:03:14 if the dictionary fills up, i make a new one, copy reachable objects, and flip the here pointer 17:03:27 so there is 2 dictionaries but only 1 is in use 17:03:36 Well, you need compressing, it seems. 17:04:14 Main idea. 17:04:35 You have bottom of your dictionary. 17:04:44 Walk to the top. 17:05:07 When you find free space walk to next used space. 17:05:22 Move used space down, correct pointers. 17:16:44 --- quit: proteusguy (Read error: 104 (Connection reset by peer)) 17:17:35 --- join: proteusguy (~proteusgu@69.79.24.31) joined #forth 17:45:37 --- join: blockhead (default@dialin-558-tnt.nyc.bestweb.net) joined #forth 17:51:27 --- quit: qFox ("this.is.not a.real.netsplit") 18:00:37 --- quit: Topaz ("Leaving") 18:08:35 Good morning, blockhead! 18:08:50 good morning ASau (though ti si evenign here :D ) 18:09:22 I got my forth working good now. All but the compiler words. 18:09:26 * blockhead is happy 18:12:01 * slava 245 LOAD blockhead 18:12:28 :D 18:12:37 actually it's not block-oriented 18:13:14 I had gotten it working over a week ago, but knida wonky. Basically it would ignore every other word taht I typed 18:13:25 haha 18:13:37 i/m working on my cross-compiler 18:13:50 It was cool when I typed "1 2 + ." and it actually came back with "3 OK" 18:13:50 trying to get it to compile enough stuff so that the outer interpreter can be cross compiled 18:14:59 at the moment it can generate a 512-byte image that does various list and airthmetic operations :) 18:15:08 nice 18:15:28 * blockhead woudnd't even try to attempt that feat :D 18:16:25 its not a big deal, the image is not native ELF but a portable format loaded by the inner interpreter -- its basically a memory dump of the dictionary 18:16:30 with relocation info 18:18:38 :) 18:19:20 this morning I added a crude sort of stack checking. Lots of progress today :D 18:19:26 stack checking? 18:19:45 you knwo, for popping an empty data stack 18:20:13 it's crude becasue the outer interpreter does it after a word is executed 18:20:56 ah 18:21:10 i do stack bounds checks when popping 18:21:11 writing the : word is a scary thought :o that's next to do 18:21:18 heh 18:21:33 : is simple if you have all the factors :) 18:21:38 slava: your way is better, but I wanted it code it small and simple 18:21:39 like ] & friends 18:22:04 start with this : : create ] ; 18:22:05 :) 18:22:21 can't use : cause I don't have it :D 18:22:29 are you cross compiling/ 18:22:55 no. it's still an asm file 18:23:15 the .com file is 3k now ;) 18:23:41 cool 18:23:58 my new interpreter is 700 lines of C, 8k executable :-) 18:24:10 i'm aiming to keep the finished one around 20k if possible 18:24:14 so that it fits entirely in the cpu cache 18:24:33 i want a memory usage of 300-400kb or so with the default set of sources loaded 18:24:45 8k is nice for c :) my c compiler makes 100k files for some reason. :/ 18:24:51 is it statically linked? 18:24:58 i 'strip' executables 18:25:01 and dynamic link 18:25:26 also my interpreter is about 3x faster when compiled with -O4 -march=pentium4 -fomit-frame-pointer than with no flags 18:26:22 I think it is a staticly linked, because it is a com file not an exe file 18:26:28 oh this is win? 18:26:32 or dos? 18:26:53 dos in windows 18:27:05 * blockhead likes the command line 18:27:07 seen pygmy? 18:27:22 havn't tried it 18:27:27 its very nice 18:27:44 200 blocks of source for assembler, meta compiler, editor, utilities -- compiled .com is 18k 18:29:19 blockhead: my inner interpreter is still 5x or so slower than gforth, because a thread of code is a linked list not an array :) 18:29:52 sounds kind of like eforth, but with some more features. I might go look at it. 18:30:37 the primary app written in it is the http server. 18:30:51 its very easy to write and debug web apps interactively, and less worries about security because the language is 'safe' 18:31:06 the kernel provides object primitives, not direct memory access -- you can't write to an arbitrary pointer 18:31:52 can you smash the stack? 18:31:56 pygmy comes with a web server? that's cool. 18:32:02 blockhead: no not pygmy! 18:32:04 blockhead: my system 18:32:08 blockhead: pygmy is very minimal 18:32:20 solar_angel: no 18:32:42 solar_angel: you can overflow the stack 18:34:44 can you do any damage that way? 18:34:55 solar_angel: yes, at some stage i will add a stack overflow check though. 18:36:01 cool. 18:38:44 solar_angel: your forth is STC right? 18:39:22 my advanced methodolgy for stack over flow: hope it doesn't happen :D 18:39:33 blockhead: in practice that works very well 18:39:42 blockhead: esp if your interpreter has tail call elimination for the call stack. 18:39:50 yes, mine is STC 18:39:54 yeah: underflow is a more common occurance 18:39:55 solar_angel: do you have SEE? 18:40:02 SEE? 18:40:07 is that the one that decomiles words? 18:40:09 yes 18:40:13 nope. 18:40:17 I allocate 1k for each stack and that will hopefully be enough 18:40:18 i can just RTFS 18:40:25 heh 18:40:38 blockhead: at the moment my stacks are 64 entires :) 18:40:41 if I do stuff like tail-recursion optimization, I can save stack usage 18:41:15 I plan to add a word, called tailcall, to be used instaead of RECURSE when possible 18:41:24 slava: is that enough? :o 18:41:31 you can make it automatic 18:41:37 with the appropriate definitin of ; i think 18:42:45 I'll leave it up the programmer. tailcall and recurse will both be valid compilar words 18:43:47 --- quit: proteusguy ("Leaving") 18:45:27 * slava is coding a little hashed vocabulary implementation 18:45:43 i have to write all this stuff myself now, can't rely on the java apis any more :-P 18:45:55 what is generally better, 'open addressing' or chained hashing? 18:47:13 dunno. I don't know what open addressing is :( And while I've heard of hashing, I've never heard of chained hasing :( :( 18:47:24 dumb q - how can i use create to make a derivative of ':noname' that does stuff after the ';' ? 18:47:48 dynamic rehashing is the best i've dealt with. 18:49:13 --- join: JasonDamisch (~jdamisch@sub22-119.member.dsl-only.net) joined #forth 18:49:28 --- join: ForthFreak (~cryptobot@ppp-62-245-209-226.mnet-online.de) joined #forth 18:49:43 'morning 18:49:47 Hi Speuler 18:49:55 --- quit: JasonDamisch (Client Quit) 18:50:10 no matter what pseudonym i go, one recognizes me :( 18:50:35 Guten Morgen! 18:50:35 Hehe. Nice to see you again. :) 18:50:38 i was just on a bzflag server 18:50:45 with nick name "semtex" 18:50:55 one admin asked "you're forthfreak?" 18:51:00 ForthFreak: if you want true irc anonymity, you should use i2p - http://i2p.net - I2P has anonymous bridges to freenode.net 18:51:43 probably. otoh, "forthfreak" is not ideally suited to hide my identity. 18:53:25 btw, put some simple record/filed scheme together, t'is on http://forthfreak.net/wiki/index.cgi?RecordConstructor 18:53:50 wsa recurring problem, and my previous solutions didn't satisfy 18:54:29 and finally i found a use for construct "create ... does> create ..." 18:56:19 Heh. 18:56:28 * Robert checks 18:56:45 Robert: it was some time ago or I'de have links for you :( sorry 18:56:59 woops: wrong window enitrely D 18:57:01 sorry 18:57:06 robert, just ignore me 18:57:12 I'm a blockhead :/ 18:58:06 --- join: hefner (~hefner@ip68-100-210-132.dc.dc.cox.net) joined #forth 18:58:56 what's the best portable c-extensible embeddible forth? 18:59:06 ficl, it is said 18:59:12 ah, ok 18:59:22 but that's only 2nd hand opinion 18:59:39 ForthFreak: I download one called p forth some time ago ... but never tired it :D 18:59:42 tried 18:59:45 i'm using ficl, have forked a version with an additional stack for python objects, and words to drive the python api 19:00:24 working on a set of words to support creating python classes/subclasses, and implementing methods of these in forth 19:00:34 nice 19:01:11 calling it 'forpy' 19:01:29 blockhead: :) 19:01:44 not "forthon" ? 19:02:18 ForthFreak: Looks nice, the record code. 19:02:31 essentially simple stuff 19:02:48 helps to clean up code considerably 19:02:54 google had less hits for 'forpy' than 'forthon' 19:03:34 * blockhead wonders what to call his forth, since it deviates from the forth standards already 19:04:49 tlfkaf 19:05:03 )the language formerly known as forth) 19:05:12 blockhead: is there a forth that actually complies with forth standards? 19:05:31 'standards-compliant forth' is like 'military intelligence' - an oxymoron 19:05:50 aum: wel, I think some do, like I think e-forth is forth-79 complient ... not entirely sure 19:05:52 Yes, there is. 19:06:01 FIG Forth is standard by itself. 19:06:05 the forth I used to use on the amiga was forth-83 complient 19:06:38 blockhead: mvp-forth ? 19:07:02 MVP is similar to FIG. 19:07:14 mine's going itd own way :D first thing to go was the string handling 19:07:45 * blockhead never used mvp-forth 19:07:57 the amiga forth was jforth 19:08:14 nice bit of work, that. just slow file I/O 19:08:18 blockhead: string handling can be build from standard words, thus does not need to deviate from standard for sake of string handling ? 19:08:59 ForthFreak: umm, no, the whole pad thing, all that ... gone. My strings are null terminated 19:09:32 you scan the strings to find out their length ? 19:09:47 yes, using "strlen" :D 19:10:23 i use cell size length field 19:10:36 the only exception that is dictionary, it uses a length byte AFTER the string 19:10:39 cause long strings are troublesome to count length 19:11:08 approaching the age of 64-bit cpus 19:11:21 and 255 byte long strings :) 19:12:02 i like to be able to express, say, a 2 mbytes data record, as one string 19:12:33 that record may have embedded zeroes 19:12:34 * blockhead faints 19:12:59 wait: so it's not properly a string, just a large chunk of binary data 19:13:04 right 19:13:26 with length info 19:13:40 so it is not a string. :D 19:14:01 why should it have to be something different ? 19:14:19 no need to use a different data structure just because it contains zeroes ? 19:14:47 a string (for my forth) is a bit of readable ascii text, not too long, terminated by a zero 19:15:00 (note the "readable") 19:15:11 the machine doesn't care about whether i can read it or not 19:15:12 that would preclude zero 19:15:14 NUL is ASCII symbol. 19:15:22 right, the string terminator :D 19:15:27 No. 19:15:45 US, RS, GS are separators. 19:15:48 Not NUL. 19:16:22 eot is ascii 4 i think 19:16:24 String should be ended with ETX. 19:16:55 I think. Logically. 19:17:19 If you mean "string" as "readable text." 19:17:36 If you count... 19:19:05 ForthFreak: actually, now that I think about, my forth couldn;t have a 2 meg block of data anyway. one of the early decisions was to limit it to a 64k address space (based ont eh fac ttht I didn't want to deal with segmented addressing) 19:19:28 blockhead: what cpu ? 19:19:33 p4 :D 19:19:50 but coding as if an orignal 8086 19:20:00 16 bit intra-segment limit doesn't apply there 19:20:06 ah. real mode 19:20:43 --- join: htp123 (~tehsux@S0106000d6151238b.gv.shawcable.net) joined #forth 19:20:53 64k is all it knows. since the ofrth will mostly be reading and writing to files, this won't be a problem. 19:20:57 cause if you'd use virtual mode, you wouldn't have chosen 64k segments 19:21:34 i figure you were scared to dive into protected mode :) 19:21:43 yep 19:22:09 did that for a pentium-based forth (stand alone) 19:22:23 wasn't knowing much about protected mode before 19:22:28 dos/windows memory managment give me the willies 19:22:29 but wasn't that bad 19:22:48 ForthFreak: standalone as in ... it was the OS? 19:22:54 right 19:23:00 no bios 19:23:01 no os 19:23:03 no nothing 19:23:08 that would make the memory manamgent much easier. no does or windows to step on 19:23:15 dos, not does 19:23:20 only forth, and some asm setup for the hardware 19:23:28 nice 19:23:34 like, host bridge init, pci and dram setup 19:23:44 no bios? wow. 19:23:48 cpu to protected mode of course 19:24:15 was my first "real" x86 protected mode work 19:24:48 did only do 8086-compatible real mode stuff before 19:24:55 like you i guess 19:25:06 :) 19:25:06 --- join: LOOP-HOG (~jdamisch@sub22-119.member.dsl-only.net) joined #forth 19:25:15 Hi again, LOOP-HOG 19:25:20 hi 19:25:44 well, this forth is my first foray into intel/PC assembly language. My only other assembler experience was the z80. 19:26:03 hey LOOP-HOG 19:26:18 some things are not easy to build in real mode 19:26:29 things like allocate / free 19:26:51 it helps if you can use the mmu for that 19:27:26 have address remapping done in hardware for you 19:27:30 vm style? 19:27:52 --- quit: hefner ("Leaving") 19:28:05 you probably end up moving data around 19:28:31 for allocate/free? 19:28:58 YESS!! :) 19:29:03 for example if you want to combine the holes from out-of-sequence free 19:29:15 got forth words for creating/subclassing python classes, and creating methods in forth, working 19:29:31 ForthFreak, wouldn't you just link lists around for that? 19:29:52 link hole into 'free' list or something like that 19:30:20 htp, you still would end up with non-consecutive free space after many free 19:30:45 a few hundred bytes here, some k there 19:31:07 linked lists help you keeping track of the holes 19:31:08 ah, yah i guess. i just leave them 19:31:14 and have a min size 19:31:20 but not to merge them 19:31:27 yah 19:31:34 i only merge consecutive blocks 19:31:49 that's not very dynamic 19:31:56 works well enough though 19:32:05 which might be important if lots of allocate/free happen 19:32:24 yah but i havent had any problems with it yet 19:32:32 for example, i put strings in dynamically allocated mem 19:32:38 and free it again once the string dies 19:32:56 do that a few million times 19:33:00 ah 19:33:06 that's inefficient though 19:33:20 i dont use dynamic memory very often 19:33:28 only for things like assembler 19:34:25 i still got a memory allocation/free scheme with hole combining, written for 8086 :) 19:34:35 hehe 19:34:38 just ported that over? 19:34:41 but that one moves data around to combinethe holes 19:34:49 no, written it 19:34:59 for textmode windows 19:35:21 ah ok 19:35:23 where you can close arbitrary windows 19:35:41 and have the sum of unused space available 19:35:48 in consecutive memory 19:36:32 i dont like moving memory around like that 19:36:40 seems like more overhead than worth it 19:36:45 was the best i could do then 19:37:01 well, it all depends on what you need 19:37:04 i only move data when combining holes 19:37:09 for my purposes my mm was enough 19:37:15 which happens when i run out if large enough chunks 19:37:18 yah 19:38:10 for stuff like that, allocate/free is a blessing 19:39:51 --- join: kc5tja (~kc5tja@66-74-218-202.san.rr.com) joined #forth 19:40:05 --- mode: ChanServ set +o kc5tja 19:41:37 --- join: I440r_ (~mark4@216-110-82-1.gen.twtelecom.net) joined #forth 19:41:48 executables, using that (with windows), are on http://forthfreak.net/win7.com and win8.com 19:42:29 i can put the sources there too if one is interested 19:42:34 is older stuff 19:42:51 runs under msdos 19:44:09 written around 1992 or 93 19:46:48 sounds interesting but I know that source is gonna be over my head 19:48:04 --- quit: I440r_ (Remote closed the connection) 19:51:18 * kc5tja is most happy. 19:51:29 kc5tja: got some? ;) 19:51:32 I have all of $335 in my bank account, and that will have to last me for another two weeks. 19:51:43 But, I have ALL of my external big-ticket items finally paid for. 19:51:44 kewel 19:51:55 Including this month's (well, next month's) rent. 19:52:01 "external big-ticket"? 19:52:08 that's a new phrase on me 19:52:23 That means in the next two weeks, I can start paying back my roommates for utility bills owed, but I can trickle that back. 19:52:24 from the context I think I know what you mean 19:52:38 nice 19:53:01 kc5tja: I got my forth working even better now, I even got a crude sort of stack underflow checking in 19:53:21 all I need to now is ... gulp ... the compiler words 19:53:56 i'm of again. 'll have another go at bzflag 19:54:01 off 19:54:07 ;nn ForthFreak 19:54:10 'nite 19:54:22 --- quit: ForthFreak ("CARRIER LOST") 19:56:02 Hey, too bad I missed him. bzFlag is a kick-butt game. 19:56:13 blockhead: Sweet 19:56:33 bzflag is weird 19:56:58 yes. I had had the outer interpeter workign a week or so ago, but it was shaky. Today I fixed everyting and even added features 19:56:58 * aum prefers rtcw:et 19:57:29 aum: Different game, different feel. bzflag isn't about WWII simulation. 19:57:36 what kind of 4th is it blocky? 19:57:37 i know 19:57:50 LOOP-HOG: pygmyForth is one of the best I've used, personally. 19:57:59 aum: That being said, I like ET too. :) 19:58:07 kc5tja: got a url for pygmyForth? 19:58:13 i might 19:58:25 kc5tja: ET is great, till the cheats with headbots/aimbots/etc come in 19:58:32 http://www.eskimo.com/~pygmy/forth.html 19:58:35 LOOP-HOG: it is a minimal dos cmdline forth in assembly language. it lives in a 64 k world. :D 19:58:54 that would b easiest 2 implement on a pee cee 19:59:01 that is BEST 4 your 1st 4th 19:59:11 yeash: part of my decision making process was: waht is easier :D 19:59:15 or maybe on an old ST 19:59:40 memnonio is updated, styles are added 19:59:42 Pygmy was the best for MS-DOS back when 8086 was all you had. 19:59:44 I wish I had written a forth on my old CP/M machine :( that woudl have rocked hard 19:59:49 Pygmy unfortunatley failed to keep up. 19:59:58 Hence why I'm writing FTS/Forth in my ever so copious spare time. 20:00:08 pygmy sounds intersging: mine only uses the old 8086 instructions 20:00:13 i wish that i had a good FORTH cart for my atari 800XL and tape support 20:00:25 Pygmy, cmForth, and ColorForth are the inspirations for BoxForth and FTS/Forth. 20:01:05 i don't have links for either one 20:01:17 Either what? 20:01:27 either of those forths 20:01:36 BoxForth and FTS/Forth? They don't physically exist yet. 20:01:39 cmforth and coloforth? 20:01:49 i have those 20:01:53 cmForth isn't linked; it existed for the Novix NC4000 CPU. 20:02:03 PygmyForth is an almost perfect transliteration of the Forth to 8086. 20:02:15 almost? 20:02:21 what's wrong with it? 20:02:25 ColorForth is itself a descendent of cmForth in a big, big way; it exists for Pentiums. 20:02:29 doe sit use old-style file I/O calls? 20:02:32 blockhead: Nothing. 20:02:40 blockhead: It uses DOS 2.0 API calls. 20:02:54 oh, sounds very much like my forth then :D 20:02:57 blockhead: It's "almost" because 8086 isn't NC4000. So, obviously, some things are different. 20:03:21 oh ok :D 20:03:43 Just as BoxForth isn't quite FTS/Forth (and vice versa), despite being almost 100% the same. 20:04:09 (that is to say, expect the PC version of FTS/Forth to be built from the same sources as the FTS1001-based BoxForth) 20:05:27 Although I've been toying with the idea of a ColorForth-like environment for the Kestrel. 20:06:03 * blockhead puts on sunglasses 20:06:04 Only using varying typefaces instead of real colors, thus making it more approachable to color-blind programmers 20:06:07 i think i like the idea of just having a FORTH with both CF and ANS wordsets, and maybe a few others 20:06:28 FONT-FORTH 20:06:35 LOOP-HOG: I don't, because I find 99% of the time such functionality isn't needed. 20:06:54 ok 20:07:18 That's what I love most about Forth -- if something I need/want doesn't exist, I can just define it. 20:07:21 Things "just work." 20:07:35 it s/b ok :^) 20:07:40 s/b?? 20:07:41 its a 4th 20:08:24 like its hard to code yourself into a total corner 20:08:24 LOOP-HOG: Yep. 20:08:24 you can do something funky with a vector and get out 20:08:24 but you could just redesign and avoid the funk in this case 20:08:24 Even Forth apps that claim to "require" XYZ feature can often be ported with relatively minimal effort. 20:08:28 * kc5tja nods 20:08:47 * blockhead codes himself into a corner 20:09:08 you might make the word that does XYZ feature swollow its paramaters and turn right around and drop them off the stack and then quit and the rest of the program does not need to know the difference 20:09:19 blocky..its gets better 20:09:22 FTS/Forth will be a plain-vanilla Forth environment. Users of PygmyForth will probably feel exactly like they're using Pygmy for the most part. 20:10:00 maybe i'll make a FORTH called HOG-FORTH 20:10:05 Hehe :) 20:10:08 coooooooool 20:10:11 i'm the only guy around here who doesn't have a 4th rats 20:10:42 kc5tja: I was saying (before you logged on) that I'll have to think of a name for mine because it is gettign sooo nonstandard (ie - no create does, use of 0-terminted strings, etc.) 20:11:10 LOOP-HOG: hang out here long enough and you'll write one :D 20:11:21 blockhead: Well, ColorForth also lacks create/does>. And my FS/Forth 1.0 (ahh, those were the days!) also used 0-terminated strings. 20:11:37 the forth way of doing strings always bothered me 20:11:50 I wish I had a copy of FS/Forth 1.0, so I could laugh at my earlier work. 20:11:54 blockhead, i LOVE CREATE DOES> I would understand trying out the 0-strings in a FORTH though that was intended from inception to interface to a C World 20:12:33 i use 0-terminated strings 20:12:35 i like it that way 20:12:43 LOOP-HOG: :D keep in mind that forth predates c by some time. I *think* that the whole 0-termianted string idea came about from C 20:12:47 I coudl be wrong on that 20:12:50 i agree with both counted strings and CREATE DOES> though 20:12:51 I use explicitly counted strings. 20:13:08 That is, a string is an array of bytes, and a reference to a string is an array slice. 20:13:19 And I define an array slice as an address and count pair on the stack. 20:13:39 --- quit: solar_angel ("*gone*") 20:15:18 It's a practice I picked up from ANSI Forth, actually, and I generalized it to any data type. 20:15:29 Therefore, my count is not a byte count, but a character count, integer count, etc. 20:15:48 But I digress. 20:15:53 about the only thing i don't like about old style FORTH is a floating TIB, **I HATE FLOATING TIB** its a text input buffer, it should NEVER mover 20:16:06 ?? 20:16:18 I don't mind a floating TIB. 20:16:34 It should only move when actually compiling code though. 20:16:40 (Since it's based on PAD usually) 20:16:52 floating PAD!!!!!!! :^( 20:17:02 * blockhead has entirely forgotten that TIB is (PAD is part of why I blew off forth string handling) 20:17:02 : PAD HERE 256 + ; 20:17:22 CREATE PAD 256 ALLOT 20:17:28 CREATE TIB 256 ALLOT 20:17:32 \ DONE 20:17:37 LOOP-HOG: Making PAD utterly useless for strings longer than 256 characters. 20:17:51 i avoid strings longer than 256 chars 20:17:55 me too 20:18:00 Sometimes that can't happen. 20:18:04 in that case just use HERE 20:18:14 For example, I treat a LOADed block as a string of 1024 characters. 20:18:32 : FLOB HERE 256 + ; 20:19:03 * kc5tja shrugs -- I *really* don't see why it's such a problem. 20:19:19 then your count needs 2B bigger than a byte 20:19:38 LOOP-HOG: The Forth engine works with cells anyway, so what's the difference? 20:19:52 i put something there 20:19:55 kc5tja: hi ;) 20:19:59 then when i hit return again its gone 20:20:01 kc5tja: I restarted with better paper. 20:20:09 kc5tja: not too far, as I was working. 20:20:10 its not permenant if you want to play with strings in interpret mode 20:20:20 LOOP-HOG: Well, that IS true. I will grant that. 20:20:21 in the example of the block as a string, it is known fixed lenght, so no need for a count. 20:20:22 I was thinking... 20:20:37 you have to put all of your test stuff into a word and then run the word because the buffer isn't persistant 20:20:52 blockhead: Precisely why keeping the count on the stack instead of in the string is a superior solution. 20:20:58 kc5tja: if you take like 8 8-disc turbines, string them toigether, would you get a better one than just 64 consecutive disks with the same amount of intakes? 20:20:59 (in most cases I've experienced at least) 20:21:36 kc5tja: although can you even think of a block as a string? :/ 20:21:46 I gues you can if you want to :D 20:21:52 arke: depends on how you string them up. If you just couple all the rotor shafts together, and provide each turbine with its own intake and exhaust, then the turbine will likely breath better. 20:22:05 arke: However, it'll be bigger, and heavier. So it's a tradeoff. 20:22:15 blockhead: I do. 20:22:30 kc5tja: well, I plan to do that. 20:22:31 blockhead: It greatly simplifies interpreting the contents of blocks. 20:22:45 kc5tja: 2x8 discs. Separate intake +_ exhaust. 20:22:45 its not a deadly problem, just a sticker in my foot 20:22:52 kc5tja: intakes lead together to a single input 20:22:53 arke: For some applications, however, a single wider turbine might be a better solution. 20:22:57 kc5tja: pwns your PT-4 ;) 20:23:18 arke: And if I make the PT-4 a 12" rotor? :D 20:23:20 compressed air planes again? 20:23:23 err...sorry, 8" rotor? 20:23:45 kc5tja: then I come up with the RK-3 20:23:49 blockhead: Nope. These motors are too big for that use, unless you scale the rest of the plane up accordingly. 20:24:00 * blockhead never minds 20:24:03 blockhead: :) 20:24:07 kc5tja: 32 rotors, in 4 batches. 10" rotors. 20:25:09 arke: PT-5, four PT-4s, each inverse coupled so the turbines counter-rotate, thus providing a net moment of inertia of zero. :) 20:25:38 kc5tja: bitch. 20:25:44 kc5tja: how would you do the inverse coupling? 20:25:44 ;P 20:25:48 oh, nevermind. 20:25:52 * blockhead imagines kc5tja in real life as being a mad scientist :D 20:25:52 I know how ;) 20:25:56 blockhead: :) 20:26:06 * jc wishes for an active geothermal vent in his backyard 20:26:07 kc5tja: RK-4. 20:26:30 * kc5tja has always wanted to try that, actually -- it'd probably beat the shizznit out most car engines, let alone gas turbines found in most applications today. 20:26:44 kc5tja: 12" rotors. 64 of them. 8 sectors, with separate exhaust pipes. Aluminium parts. Inversely coupled. pwned. ;) 20:27:45 arke: And a motor that big will fit where? :) 20:27:47 What would be interesting is to have active spacing between the discs, and use a feedback loop to optimize the spacing. 20:27:50 kc5tja: damn. That thing would be better than my fucking car. 20:27:59 oh, i guess that i'm going to go add a do-hicky to my thingamajig 20:28:09 LOOP-HOG: :D 20:28:14 --- quit: LOOP-HOG () 20:28:16 jc: It's doable. 20:28:17 LOOP-HOG: Oh really? You should also considering adding a Foo to your Bar 20:28:27 :D :D 20:28:41 DAMN 20:28:42 lol 20:28:54 I think loop-hop was overwhelmed with the science in the air 20:29:12 :D 20:29:13 The neat thing about active spacing would be that as air density and humidity changes, it would auto-adapt. 20:29:26 jc: That was going to be my next one-up on arke, but just thinking of his bigger engine distracted me because of it's sheer size compared to any vehicle it would likely fit in. :) 20:29:36 :) 20:29:57 * jc thinks of vehicles labeled 'Mac' and 'Kenworth' 20:30:02 Well, I've still got one up on you after that. 20:30:10 the discussion begins to make more sense once I realize that kc5tja has a rotary engine in his car 20:30:13 er, Mack. Too many years in the computer world. :) 20:30:13 :D 20:30:31 kc5tja: attach to a hydraulic tilt plate, and add a CVT cone+belt ;) 20:30:45 stick it in my car, and go 200mph 20:30:50 ...with paper 20:30:51 lol 20:31:14 I could mount it in the rear as a fifth wheel, using the exhaust for air ^_^ 20:31:40 attach it to the acelerator pedal .. :) 20:31:51 * arke will now stop dreaming. 20:32:07 * blockhead puts an arke-charger(tm) in his car :D 20:32:18 vroooooom 20:33:12 l33t. 20:33:30 I'm SOOO gonna build a little tesla turbine vehicle 20:33:53 that could be very cool 20:33:55 perpetual motion machine! 20:34:17 TTs are not perpetual motion machines. 20:34:20 push it once. The air from out front drives the tesla. 20:34:26 the tesla makes it faster. 20:34:30 making more ait from front. 20:34:31 etc. etc. 20:34:32 ;) 20:34:39 kc5tja: I'm dreaming, remember? :) 20:36:00 * blockhead pictures arke kc5tja in a Delorian with a time machine in it. :D 20:36:08 Hehe :D 20:36:18 once you hit 80 mph :D 20:36:19 Delorians are awesome looking cars. 20:36:26 kc5tja: yes 20:36:27 I travels at 80MPH all the time. 20:36:30 :) 20:36:35 kc5tja: I DID TODAY!!! :) 20:36:39 I actually went 85 20:36:41 heh 20:36:54 If I'm in a real hurry, I'll do 100MPH on the freeway. 20:36:56 kc5tja: I went up that hill between thousand oaks and camarillo on the 101 today. 20:37:04 blockhead, well you nned to do 80 for the time machine to work :D 20:37:12 kc5tja: flooring 4th gear (3.25k rpm) just barely held me steady at 60 ;) 20:37:19 that was a weird typo 20:37:33 blockhead: It's when you start answering yourself that a problem is said to be in the making... 20:37:49 lol 20:37:53 that was the typo. how the hell did I type "blockhead"? 20:37:57 what a blockhead 20:38:02 arke: yeah 20:38:20 blockhead: just wait for my l33t m4ch33n3 20:38:41 will it have an oscilation overthruster? :D 20:38:54 red lectroids from planet ten! 20:38:58 * blockhead stopd :D 20:39:26 http://www.cortland.edu/ace/ace2000/john/delorian.htm 20:39:34 That site is required viewing 20:40:19 slow loader 20:40:30 oooh! Coooool!!!!!!! 20:40:31 ;) 20:40:55 lol - like the mini figs :D 20:41:36 ;) 20:43:07 Yeah 20:43:43 It's sites like that that make me glad to have the Internet. 20:44:43 i have a german powerpoint here. 20:44:52 I think I might translate it and send it to people. 20:45:29 das powerunpointerummmm? 20:45:32 :D 20:45:36 ;) 20:48:39 * arke shower 20:51:26 Heheh 20:53:56 --- quit: aum () 21:08:11 back 21:08:12 ;) 21:14:11 hmm. 21:14:23 ? 21:14:31 Damn, I need to shave. 21:14:32 I wonder if I have spare CDs that I don't need and can screw up. 21:14:38 I have 2. I need 6 more. ;) 21:14:42 kc5tja: go shave then. 21:14:45 kc5tja: :) 21:15:10 I'll do it tomorrow. 21:15:30 if i didn't have to work i'd probably never shave 21:15:31 :D 21:19:54 i dont have to shave yet. 21:19:58 I'm kinda behind :) 21:21:47 gonna shave your behind :D 21:22:05 TMI interrupt. 21:22:05 well 21:22:09 this is very odd. 21:22:15 I have no hair in my face 21:22:19 nad my ass is a fucking forest 21:22:20 lol 21:22:35 SIGTMI 21:22:49 ok, it's late and I'm ggeting from silly to crude. I better go 21:22:53 and get some sleep 21:22:56 Hehe 21:23:01 'nn all 21:23:05 Night blockhead 21:23:08 --- quit: blockhead ("laugha while you can, monkey boy") 21:23:13 * kc5tja is going to read something, I think 21:23:24 Something preferably not on the computer. 21:24:04 eww 21:24:26 hrm. 21:24:29 SIGTMI 21:24:29 lol 21:24:59 ;) 21:25:33 If that TMI refers to the lifestyle of native Americans in 1491, then I guess... :D 21:27:01 http://ars.userfriendly.org/cartoons/?id=20040624&mode=classic 21:30:43 teehee lol 21:39:39 kc5tja: would it also work to have 4 equally spaced holes instead of the semicircles you have for the exhaust? 21:42:24 would make my life easier. 21:42:32 it seems that the AOL CD one is doing it like that. 21:42:32 ;) 21:44:01 arke: what are you building? 21:44:20 tesla turbine. 21:44:49 how's it work? 21:44:54 out of CDs? 21:45:02 no idea. Ask kc5tja ;) 21:45:09 hehe 21:47:40 * arke is like that 21:48:06 * arke listens to Nirvana - You know your right 23:01:41 yo 23:07:06 hi 23:08:30 --- quit: htp123 (Read error: 110 (Connection timed out)) 23:14:39 arke: whats up 23:14:54 building tesla turbine 23:48:10 --- join: htp123 (~tehsux@S0106000d6151238b.gv.shawcable.net) joined #forth 23:52:40 arke: Sorry, was away reading. 23:52:48 Yes, it would work to have equally spaced holes. 23:53:14 What matters most is exhaust port area. It's shape isn't TOO critical except in certain cases that you'll never, ever reach with a paper design. :) 23:54:03 :) 23:54:10 kc5tja: well, I have 4 cardboard discs. 23:54:30 kc5tja: I have the hole layout ready, just need to adapt it to all 4 23:54:40 (did i mention that it is a BITCH to put holes in cardboard?) 23:57:51 --- join: topher (~chris@lsanca1-ar42-4-61-175-184.lsanca1.dsl-verizon.net) joined #forth 23:59:59 --- log: ended forth/04.06.25