13521. Tom 7 (pool-108-32-43-250.pitbpa.fios.verizon.net) –
21 Apr 19:51:47
[ SIGBOVIK 2018 ]
Scott: hehe thanks :) I have no doubt that it's some data error, since that of course would be a ridiculous title for a paper. (In my mind it's a bad scan of some graphic design that has the word "grid" repeated over and over, like in a grid.) Since the one you mention is from "gridlines", one could imagine that (maybe their logo is like a bunch of copies of the word "grid" in a line :))
Anon: PocSci will be May 25, although I don't have any official info!
Tristan: While I certainly appreciate (and very much deserve) pedantic corrections, I think this is not a mistake. Long ago when I learned C programming, the book I was reading insisted on a difference between "null" (i.e., the null pointer) and "nul" (the byte 0). You can see for example in a table of ASCII that this byte is usually abbreviated "NUL." That said, writing it with one L is rare in the modern era, and maybe it should have been capitalized as NUL in this context. No doubt there are many incontrovertible errors in the paper, should you wish to dig. |
| |
13520. Tristan (nkugateway.nku.edu) –
19 Apr 15:16:07
[ SIGBOVIK 2018 ]
Tom,
I have very pressing news regarding your Academic Advancement Advice: Author Articles as A.A paper. I don't want to shock you, but I'm afraid to say that you've submitted a paper into a prestigious academic conference without proper copyediting. I've found a typo in section 3: The Data, paragraph 1, sentence 5. You've seemed to invented a new type of byte, called "nul-byte". Now I would never accuse you of missing such a grave mistake, this was probably the fault of the copyediting agency you hired to look over this paper before publication. Here I will provide some other, highly reputable agencies that would never make such a mistake. I hope you find their services useful in the future.
Agencies:
Enago
The Proofreaders
Laurel Copyediting
Best of luck,
Tristan |
| |
13519. RadAcoustics (cpe-123-211-13-135.bpbb-r-033.cha.qld.bigpond.net.au) –
17 Apr 07:26:07
[ Quake 3 Done! ]
Tom I refuse to let this thread die. 4 yrs since my last post and it's still here there was a reason I called this the eternal thread. The old school posting look its like a magic nostalgia trip. So after 16yrs do we have the record, if not i'll post again until we do. |
| |
13518. Anonymous (107.77.97.107) –
05 Apr 20:47:21
[ SIGBOVIK 2018 ]
Do you have the date for PoCSci? |
| |
13517. Anonymous (43.242.116.35) –
02 Apr 22:22:27
[ ARST ARSW ]
> I'd find a phrase in the audio, then type "if this is a consular ship where
is the ambassador" and it'd just split up that loop into 10 mini-loops of the
same length, one for each word.
Tom, why didn't you use a subtitle file to skip this step? It would contain literally the entire *timed* movie dialogue (in an easily parse-able format). |
| |
13516. Scott / Graue (104.193.170-14.public.monkeybrains.net) –
01 Apr 22:43:54
[ SIGBOVIK 2018 ]
I've really Folin in love with your writing.
I looked for the Grid grid grid grid grid... paper and only found this - maybe it's a data issue? “Leigland, James; Russell, Henry. 2009. New Needs for Technical Assistance : Responding to the Effects of the Financial Crisis on Private Participation in Infrastructure. Gridlines; No. 49. World Bank, Washington, DC.” |
| |
I never responded to their final mail, and they seem to have abandoned the complaint. |
| |
You have less than four simultaneous 24-hour rotations of Earth until the next post. Good luck finding the Easter eggs. |
| |
So what was your reply to their pointless final email or did you just forget about them after that? |
| |
13512. Anonymous (197.156.77.164) –
25 Mar 18:39:31
[ BAD SAT SCORES ]
I scored 1100 on the new SAT. I think I have nice GPA. Do I have a chance of getting to NYU? |
| |
Hey Tom
I am having a blast with your AI program.
currently running Gradius as it is my favorite childhood game.
I will post the results here when done.
thanks |
| |
I haven't modified that version since release. I recommend setting the priority of the helpers to the lowest class; I didn't have any problem playing games or whatever foreground apps when I was running it for days on end to make those videos.
There's a new version in development now which is easier to use, but saving is still a difficult feature to support, so it's unlikely, sorry! |
| |
is there still no save feature at all? i want to have playfun learn mega man, but i don't quite appreciate it eating up my cpu 24/7 and i can't just have it running in the background bc it makes most programs lag |
| |
13508. Anonymous (204-228-137-196.utopia.xmission.net) –
13 Feb 23:41:29
[ SIGBOVIK 2017: ABC ]
I just found this video. This is easily the best explanation of *multiple* subjects I've ever seen. |
| |
13507. Anonymous (c-24-218-182-147.hsd1.ma.comcast.net) –
05 Feb 17:07:42
[ ARST ARSW ]
hu |
| |
Anon1: I've tried this, but so far without any real success. GPUs don't seem well suited to executing NES instructions, unfortunately. I have some more ideas in the queue that I hope to get back to, though.
Oaklr: Are you running helpers first? It's saying it can't connect to one on port 8000. Some other comments on this page may show you what you need to do, but I also tried to write it clearly in the readme... |
| |
Thanks Nate! There is no one secret, but I will say:
- Write down all your ideas, even the bad ones.
- Always use your best idea; don't hoard them.
- Every project has awful slogs in it and your body and brain tell you to just give up. Not giving up in those moments is what I think it feels like to "be creative," so you just have to be willing to suffer that stuff.
It seems you can use the editor straight from the source repository:
http://svn.code.sf.net/p/tom7misc/svn/trunk/anagraph/editor-ceors.html
Begin by hitting backtick to switch modes, but you probably need to view the source code (editor.js) to make any sense of the UI. Unfortunately you won't be able to save without downloading the helper app and compiling it (and good luck; it's Standard ML), so it won't be that usable except just to mess around. But obviously feel free... |
| |
You still have a few hours to post.
|
| |
Hey tom i had an error with playfun it reads
SDLNet_TCP_Open(127.0.0.1:8000): Couldn't connect to remote host |
| |
Tom I absolutely LOVE your videos and your work, you are extremely talented! How do you remain so creative and motivated? Do your ideas just come to you or do you have some kind of brainstorming work flow I could steal?
(Side note: Would you consider releasing the font editor you made? I would love to play around with it if you did.)
|
| |
Shantanu: Well, it just allows anyone to comment without making an account, so the IP addresses are to provide some form of accountability. For example I use them to ban spammers. :) This was very common practice when I wrote this blog software (e.g. on IRC you could always see the IP address where each person was connecting from); I hadn't really thought about the fact that this is not common any more. Normally it shows the reverse DNS, but I guess my reverse DNS server was not functioning.
jonas: Precision nitpicks are certainly welcome! I think this is a gap in the "proof" (and a good example of the kind of thing you have to account for when you REALLY formalize something). It seems like you could easily handle this by adding rules like "{0 <=> {" and "0} <=> }", which would then allow the deletion of any extraneous zeroes, which yields a single normalized representation of any Turing machine state with no leading or trailing zeroes (treating the cursor's location as also nonzero). I avoided using rules like this because they add ambiguity to what rules apply at any given moment, which makes other reasoning harder (you need to think about equivalence classes of states, I guess). |
| |
Nitpicking time! I'll complain about a technical detail that you could just leave an exercise for the reader in an ordinary article, but since this is an introductory kind of video that pretends to be very precise, I get to do this.
Your definition of the halting problem asks if the tape ever gets into a specific state. The tape is potentially infinite, padded with zeros. Your reduction of the halting problem to the kerning problem makes sure the tape is expanded with zeros when necessary, but it never shrinks the tape. How do you then reduce checking for a specific state of the tape to checking for a specific destination word in the kerning problem, when the latter word could be padded with an unknown an unbounded number of zeros?
|
| |
That's quite a lot.
Also, why do the comments record IP addresses? |
| |
Thanks folks! I'm glad that the lecture video seems to have found an audience. :)
I don't actually take my watch on every run, especially when I'm doing an indoor treadmill where it's hard to measure the actual "mileage." So I don't really know. But it's at least 708 miles, since that's the total that I did record during the period. Not bad; that's at least 30 miles a week. |
| |
Hey Tom, loved both new videos. I really enjoyed your lecture and would love to see more Tom Academy videos in the future, especially ones about logic as I find it fascinating. Keep up the great work as always and congrats on the 159 day running streak, that's great! |
| |