You can do the same with the N810.

Thanks nhanquy.

My phone (moto v3xx) is properly configured. I've got the right cables. USBControl is installed and works. My 810 connects to the phone properly. The only remaining problem is an "Incompatible usb device" error message.

Any hints how to overcome this? An obscurely written item on maemo.org seems to be saying I need to recompile the kernal. I'm shaking in my boots at that prospect. :-)

Thanks again.

I guess I have a hard time understanding why you would want to do an Internet Sharing through USB when you can download maemo-pan and use the Internet Sharing app in Windows Mobile 6.1.

https://garage.maemo.org/projects/maemo-pan

There's the link to Maemo-Pan.

Here is the link to where you can get the download for Windows Mobile 6.1 for the BlackJack I. Unfortunately if you have the BlackJack II I don't think that you can upgrade.

http://mobile.txcaesar.net/mobile/

Edit:
If you don't want to upgrade to WM6.1 here is a link to the necessary files for Internet Sharing:
http://forum.xda-developers.com/showthread.php?t=321393

Yes, the N810 is Turing-complete, except for the obvious storage limitations, so I'm sure it can do it.

I think I've seen references to success, but not sure where; you'll have to connect it, get it seen as USB-serial or ACM, and use PPP (I think) just as on any other machine. You'll probably want to set up a dummy connection as well.

Im going off topic here, but I have heard references to Turning-Complete multiple times on this forum, and read the Wiki article on it, but can someone explain it in simple terms. Its really bothering me...

What might be happening is that the Blackjack is going into slave mode, and trying to draw too much power from the n810, forcing it to turn off its USB. I don't think this is the problem tough. Use hbail's solution. Simple and elegant.

Means it can do anything a Turing machine can do; mathematicians and computer scientists like that, because they've already proven a Turing machine can do most anything. But one characteristic of a Turing machine is infinite storage space, so a logical system (such as a high-level program language, or Life) can be Turing complete, but a physical machine can't ever. If you relax the requirement by accepting anything with some general-purpose store (and assuming that's infinitely large), any general-purpose computer is. A 4-function calculator isn't.