Talk:AviSynth

Latest comment: 5 years ago by Kibi in topic Link to AvsPmod page

Could you guys merge http://en.wikipedia.org/wiki/Avisynth and http://en.wikipedia.org/wiki/AVISynth . Since the official name is Avisynth, i prefer you move the contents from the second link to the first one.

Thanks, Wilbert Dijkhof (AviSynth doc writer) 131.155.54.18 12:53, 15 September 2005 (UTC)Reply

Merge in progress. -Yipdw 19:51, 16 September 2005 (UTC)Reply
Eep... this is not good. I will try and help with that later too. —EatMyShortz 15:25, 5 October 2005 (UTC)Reply
Actually, it seems the most common way to write it on the website is AviSynth. Therefore I suggest MOVING the AVISynth page (the most built-up one) to AviSynth and then merging Avisynth into that. —EatMyShortz 15:18, 13 October 2005 (UTC)Reply
Merge complete. I think I've been very fair in including all the possible info from both pages. It is all there - there may now be "too much" info, so feel free to edit it down. The most important thing is I haven't just hacked out one of the articles. —EatMyShortz 15:18, 13 October 2005 (UTC)Reply

Loops and subroutines in AVISynth

edit

It is possible to construct a loop via recursion, and subroutines are also possible via the function syntax.

Here's an example:

function multiblur(clip clipin, int "numberofblurs") { 
   numberofblurs<=0 ? clipin : multiblur(clipin.Blur(1.5), numberofblurs - 1)
}

This works because AVISynth isn't passing the clip by value (thank goodness :) )

I've removed the comment re: Turing completeness because I'd like to see a proof of that before we mark it as such. (I haven't done one myself due to lack of time, but if one exists, I'd have no problem with going through it.) -Yipdw 07:52, 2 October 2005 (UTC)Reply

Ah! Did not know that. Thanks. Also... sorry about the Turing completeness, I assumed it wasnt since there's no loops. But given that there is recursion, I suspect it would be TC. —EatMyShortz 15:25, 5 October 2005 (UTC)Reply

Turing Completeness

edit

I want to have a discussion about this so we can write on the page "THIS IS TURING-COMPLETE" or "THIS IS NOT". I'm not entirely sure what classifies as TC - I'm learning about it currently at uni. So hopefully I'll be able to contribute better soon. But, from the wiki article Turing completeness, here are the language features I understand you need to be turing complete:

  • Some sort of looping - iteration or recursion or both. (As we discussed above, AVS has recursive functions so its OK for this criteria).
  • An infinitely expandable set of memory cells - ie. the language must support either arrays, lists, stacks, raw access to memory, or something like that. Unfortunately (as far as I can see) AVS has none of these features. Which *almost* makes me discredit TC except that I figured it supports arbitrarily-long strings! So although it's quite stupid to do so, it seems feasible to implement an array or stack/queue using string concatenation and substring reading.
    • I know there's no char data type, or (from what I've seen) any way to write binary/ASCII data to a string, but it's still possible to implement an array in a really dodgy way by first converting bytes or other numbers to decimal notation and writing that to the string.
  • Ability to accept an arbitrarily-long input stream. This one has me the most "worried" that it isn't TC. Unlike most general-purpose languages, AVS has no "standard" input at all. The only input is from videos which doesn't really count (simply because you have to open files from the hard disk and that doesn't really fit with the "turing machine"). So, I'm not sure if this is actually a barrier to its TCness. Does anybody know?
  • Summary: It seems that although AVS can "solve" any problem that a turing machine can solve, the parameters have to be built into the program and can't be supplied by an input stream, which may make it non-TC. Any thoughts?

EatMyShortz 05:37, 14 October 2005 (UTC)Reply

You can define infinite number of variables in AviSynth script, use if statement (at least in form of ternary operator) and create subroutines (block of codes). As far as I understand, it allows you to solve any computable problem. Input/output is not a part of Turing completeness definition. When you write the script, you make implicit input. --Kibi (talk) 12:18, 18 March 2019 (UTC)Reply

Not all programs that handle AVIs work with avisynth

edit

AviSynth uses the windows VFW system to interface with the media software. Any program that uses the VFW codec system will work with avisynth, assuming it allows file without an extension '.avi'.

Programs such as VLC Player handle avi's with their own routines and do not use the vfw system, you cannot use avisynth with such a player.

I have made a small change to reflect this. HighInBC 19:39, 22 February 2006 (UTC)Reply

That is not the same Richard Berg. The Berg involved in AVISynth work is much younger, and is the Richard Berg active over on the forums at Ars Technica (arstechnica.com) 69.232.197.67 08:29, 25 June 2007 (UTC) XaiaXReply

SUPER != free software

edit

SUPER (Simplified Universal Player, Encoder and Renderer) is a free software from eRightSoft that can encode most common video formats and has full avisynth support.(requires 128MB RAM)

Although SUPER uses free software for all its processing, the application itself is not free software, its freeware. The section should be rewritten so SUPERs status is clear. 91.135.34.232 01:24, 23 July 2007 (UTC)Reply

AviSynth syntax highlighting lost

edit

Since the switch from Geshi to Pygments for syntax highlighting (phab:T85794), support for AviSynth was unfortunately dropped, as can be seen with the plain text formatting on this page, and others such as Combinatorial number system. If we want AviSynth syntax highlight support again, it will need to be added to Pygments. John Vandenberg (chat) 03:34, 13 July 2015 (UTC)Reply

edit

Hello fellow Wikipedians,

I have just modified one external link on AviSynth. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

 Y An editor has reviewed this edit and fixed any errors that were found.

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—cyberbot IITalk to my owner:Online 23:43, 31 March 2016 (UTC)Reply

edit

Hello fellow Wikipedians, could you help with a new page creation?

There is a link to AvsPmod in AviSynth compatible programs section. The page does not exist at Wikipedia, and I tried to create the corresponding article, see Draft:AvsPmod. The article was rejected as the reference base was not enough good to meet Wikipedia requirements. To me it's strange, because I provided links to real magazines (published in paper) and even scientific publications. I found that there are learning IT courses where AvsPmod (along with AviSynth, of course) was used as one of major tools.

I'm new to the process of creating new articles and do not have enough experience in defending it and using Wikipedia bureaucracy. After fourth refinement I surrender - it's much easier to press reject button, than find another evidence of notability, write it in appropriate form and wait another two month only to get another rejection. As a result I decided to put the article at my own site here: https://kibi.ru/avspmod

In case the Draft:AvsPmod is deleted, I saved it as user page User:Kibi/AvsPmod

Could you help in resolving the issue, when AviSynth has explicit link to AvsPmod page, but page itself is impossible to create, since submission was declined as not a notable subject?

--Kibi (talk) 12:56, 18 March 2019 (UTC)Reply