singular local data radio transmissions surpass distributed bit-waste of global internet
some success in data transmission at 43200 samplerate, 8 bit, mono /dev/dsp3 access, 2400 baud using Linex USB transmitter.
first transmission of alice (volume on alsamixer low at white level appended.
can be tweaked somewhat
.wav example to follow
?>?| |~|||x? |~ |?| ? ~>>|}|| @@ @ !A $>?|?|? c @@@@@? |? ? |? - words,
circulating sentence as trajector~ ?|?|| ~? ||???ߠ~ |||? |>?|>? >> ڜy worlds rewriting itself b way of endophysics~| ??> >}|??߿}? |?||? ?>???<|?~~ @Ɯ@@@@@\@@? 0 Sconcernko!wue{,Kyll et les Femmes (1981). ||?<? | |? ~<|x || |?Ү@@@X@@@`ږ6multiplication, before the missile and technolog}_?|?|??|l2VcK;Cʚ@@\@?ǿt| |6 ?~| <? I!@ "@` " @ "4 ? ~|| |ct [inn7f{kb
undwr$leadnn[of John v|~ ? ??? ||| ||>n paranoid se6hi6+ sKs;e>+ wim>߿|| ?>|~ ??>||? ? ?| ?&F @X@@@@paݲ[ menl simulatin - Konad Zusegs(t??|_}~~? ? ?|~>~||> | ~|??? ?| ?? ?>~?| ~~?? |߾?>~?|?| ||? ?>?<|>|~||| 6extend themselves across one
sentence, equal~ || |||@\@@@@@@?~ ??|? ???m66LVvk@@\@@? ? ?<|??߷~ |?? s#@@@@@@}~ > >}> ~ ?||߾????|?~|?|? ??Ǿ,6 @@@@@linding light?|x? ??2[vkNZX@@ڨ|?|| ? >l ?| ?>| >||F6Vf#+KK{s@@@anation of what~? ?Ξ~ 2C the"paper/demonstrstion culd only
be delive| } ?|>?~߿VvssKs;as tje
end. open parantjeses
explanatioo |||?> ??|| ?> |~߾? o _o ~}> | |?|??> ||} ?>߾?? ߾} ||?| |@@ʦ@@@@ʦ\@| |?< | ~? &++sthe simplest entities the
! language is~~>> ? >>~?>???uٲ[k+scl6 ked2and#manipulated a?ǿ~ | ~?||| ?> ~ | > ?>|??|~> >? | |?|? ??>?|| Ǿ ?|~?>|||~ >x|??_ |~? | > dscription of these
presentation module - fvagm~> |||?<? ?> 6@@@ب@@@@@>?|~ |||? | ?|4?|> >||| | > |?????C+dmain - and with mapping software as a mappin>|? ? |?w| ?| ?| ? ?~ || |? ߾ | ||? s3{kacr dom{of
terms. trann_ of idea || ?VFKCan interface which operates in two
directi- from the realm of spl7[Ke or expan6of|| |w | || ~? ?~ x??~~ |? ~?|?| ||?v{+ Kc@Ƙ@@@@ | ߾>|?| |>>| ~ce in terms of a Gunter Brus0incision than a
q|? ??||| >| ~ ~oua the&enty of simuطtheo6FV sc +@@@@?> ~ | > <? ?x>|>| gs, algorithmic e~a6F{sfor either
space sh |} || w ~ ||| | || ?| ?~ƤФ@X@@@@@| |?<?|>|FK{s cevise. the first crash.
marriage - marria} |o a ?|? | z | ||?>|~> | ?>??|??? | ||| |?>?|~||~ || |?| lvfV&@@@@@Zި@@@N@@^@؆@ܚ?|? | |?|? |V;+S
**Jack the Ril7FKrmation Theory
as | >?| | || |?ؾ|:?@@vel and the low level. protocols agreed
u~~|| |? ?||~ | ||||?|ߟ?| |@P@latter case of
forensic nonsunse and speculw | 66 s@@@@ZZX ~?| ||?|?? ?| ~@he +s of poverty traosmitted now to become
|~||| ?<| ?|?? | ?>|||? ~||~|l???|??| >?? x ?> ?| |? |>|| ?|~x || ?|?@@Z/ in
equally unreadable mirrred teFs4
The message in`alice.0the message of,the ripper | ￜ || ~?| ??~?~>???| > ~? ?|}~>_| ?|??|x~ | oثK#+mFC6The Looking4[s0Then>~??|w?||| ?|| ?| >|??? >???>K@\@@@@@@@_| ? > ? ~ ? }?>|||| ??|?|o~ ??~|| | |?| ~?> ? ?x roll's appen6+s A fur6obsession in both the
|x | ~|? | | | ?|>?_|~ ?x?|?| >|| ~|~>~?>?| ||? >|??|>|}~? ||?| ??|? |? | >|߾ ? ?| || |Ǽ w |_}? ~ |o |w|>?|? | ||}| |||||~??|||| ?~?~~ ? ??||,C+ʌ@X@@@@@memorably |?||| o?~|~~|>>?? ??| |? ||of the catn7{C+cldivide62c+most ? ~2 sseventy seconds.
Such was the sene,$such i? } ~ |}||> | ?? ~?||>| |ߟ?|~|~||?#{s@@@@@@ڒX@|~?? | ??| d $@ @ "
D@ ?|z~|| 6? | ??}>?|~~|| ? ||||| || ?K cmpact
or crash, a crash/collision always yet>~~{s#^ؠ^@@ ?|>|?ǿ?>
data_radio without > /dev/dsp rather for 43200 unsigned 8 bit mono rather than default 8000 khz for /dev/dsp
as at present doesn't even work as straight jack to jack audio link
to quote:
Documentation for the Kodiak Representation Language
1 The Primitives of the Language The Kodiak language admits three types of objects: categories, relations and individuals. A category corresponds to a one-place predicate, a relation to a two-place predicate, and an individual to a zero-place predicate.
Statements in the Kodiak language are in parenthesized prefix form. There are nine primitive operators: dom, rel, ind, val, equ, dif, when, not and and. They have the following form:
(dom sub super) (rel relation domain range) (ind individual category) (val relation individual value) (equ category relation relation) (dif category relation relation) (when form form) (not form) (and form ...) The following table gives an example of each primitive, along with English translations. (dom dog animal) Dog is a kind of animal. (rel birthday animal date) The birthday relation holds between animals and dates. Furthermore, every animal has at least one birthday. (ind fido dog) The individual Fido is a member of the class of dogs. (val birthday fido july-1) The birthday of Fido is July-1. (equ suicide killer victim) In a suicide, the killer is the same as the victim. (dif above figure ground) In an above relation, the figure and ground are different. (when P Q) Whenever P is asserted, assert Q as well. (not P ) P is false. (and P Q) Both P and Q are true.
also that (from below documentation) query-bind in words of manual:
The macro query-bind can be used to iterate over all the matches to a query, without consing up a list of the matches. It is designed to resemble Common Lisp's multiple-value-bind. The first argument is a list of variables and the second is a query which will be passed to the retrieval mechanism. Any arguments after the second are treated as a body of code which is executed once for each match, with the variables bound to the values retrieved by the match. Here is an example:
see more kodiak stuff further down
again this should be/could be better broken down elsewhere
[perhaps as alice]
more culled (from Norvig) documentation showing syntax for a macro and dom and rel stuff:
#||
Syntax:
(a category [inst] (rel value)*)
Example:
(a person (name (a person-name (first Joe) (last Smith))) (age old))
==>
(and (ind person-1 Joe) (val name person-1 person-name-1)
(val age person-1 old) (val first person-name-1 Joe)
(val last person-name-1 Smith))
Syntax:
(each category [(isa super*)] (rel constraint)*)
Example:
(each person (isa animal) (name person-name) (age integer))
==>
(and (dom person animal) (rel name person person-name)
(rel age person integer))
||#